1844 search results - page 141 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
156
Voted
JAIR
2007
15 years 6 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
191
click to vote
P2P
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
190
click to vote
SIAMJO
2011
15 years 15 days ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
150
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
174
Voted
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...