202 search results - page 3 / 41 » Complexity of local search for the p-median problem |
ECAI
2004
Springer
14 years 23 days ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
ICCS
2004
Springer
14 years 22 days ago
2004
Springer
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
CSR
2010
Springer
14 years 5 days ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...