1844 search results - page 153 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
139
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Genetic Algorithms have worked fairly well for the VLSI cell placement problem, albeit with significant run times. Two parallel models for GA are presented for VLSI cell placemen...
148
Voted
IJCAI
2001
15 years 7 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
161
click to vote
IAT
2006
IEEE
16 years 9 days ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
170
click to vote
ISQED
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper revisits and extends a general linear programming(LP) formulation to exploit multiple knobs such as multi-Lgate footprint-compatible libraries and post-layout Lgateb...
252
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...