1844 search results - page 33 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
CP
2003
Springer
15 years 4 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
AAAI
2004
15 years 17 days ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
105
click to vote
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
186
click to vote
ICDE
2005
IEEE
16 years 16 days ago
2005
IEEE
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
AI
2010
Springer
14 years 11 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...