34 search results - page 5 / 7 » The Cost of Monotonicity in Distributed Graph Searching |
140
click to vote
AIPS
2006
15 years 3 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
117
click to vote
AI
2008
Springer
15 years 1 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
119
click to vote
AP2PC
2004
Springer
15 years 7 months ago
2004
Springer
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
126
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
109
click to vote
HEURISTICS
2008
15 years 1 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...