481 search results - page 16 / 97 » Anytime Local Search for Distributed Constraint Optimization |
CPAIOR
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
PVM
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
CP
2008
Springer
14 years 17 days ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
AAAI
1997
14 years 4 days ago
1997
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
ICMCS
2009
IEEE
13 years 8 months ago
2009
IEEE
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...