311 search results - page 27 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
WWW
2009
ACM
14 years 8 months ago
2009
ACM
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
AIPS
2007
13 years 10 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
TSP
2008
13 years 7 months ago
2008
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
NIPS
2004
13 years 9 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...