Sciweavers

481 search results - page 8 / 97
» Anytime Local Search for Distributed Constraint Optimization
Sort
View
CP
2009
Springer
14 years 5 months ago
Pin Assignment Using Stochastic Local Search Constraint Programming
Abstract. VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems ...
Bella Dubrov, Haggai Eran, Ari Freund, Edward F. M...
FLAIRS
2004
14 years 5 days ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 2 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
EVOW
2009
Springer
14 years 5 months ago
Stochastic Local Search Techniques with Unimodal Continuous Distributions: A Survey
In continuous black-box optimization, various stochastic local search techniques are often employed, with various remedies for fighting the premature convergence. This paper surve...
Petr Posík
EOR
2008
133views more  EOR 2008»
13 years 10 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar