Back to Results
First PageMeta Content
Applied mathematics / Operations research / Distributed constraint optimization / Convex optimization / Computational complexity theory / Constraint satisfaction problem / Linear programming / Constraint optimization / Combinatorial optimization / Constraint programming / Mathematical optimization / Theoretical computer science


Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce and Milind Tambe∗ University of Southern California Computer Science Department {, tambe@usc
Add to Reading List

Document Date: 2008-10-14 04:00:37


Open Document

File Size: 247,27 KB

Share Result on Facebook

Company

Cambridge U. Press / NBC / Distributed Sensor Networks / /

Currency

Rs / /

/

Facility

Milind Tambe∗ University of Southern California Computer Science Department / /

IndustryTerm

k-optimal algorithm / k-optimal algorithms / koptimal algorithm / sensor networks / multi-agent systems / combinatorial optimization algorithms / breakout algorithm / appropriate k-optimal algorithm / 2optimal algorithms / higher k-optimal solution / 1optimal algorithms / constraint utilities / overall solution / incomplete algorithms / k-optimal solution / large increase in guaranteed solution / stochastic search / k-optimal solutions / /

Organization

American Geophysical Union / Defense Advanced Research Projects Agency / Milind Tambe∗ University of Southern California Computer Science Department / Department of the Interior / /

Person

Milind Tambe / Jonathan P. Pearce / Graph Theory / Ai / /

Region

Southern California / /

Technology

combinatorial optimization algorithms / breakout algorithm / koptimal algorithm / 1optimal algorithms / DCOP algorithms / incomplete DCOP algorithms / 2optimal algorithms / local DCOP algorithms / /

SocialTag