693 search results - page 33 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
144
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
130
click to vote
ICDCS
1999
IEEE
15 years 6 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
151
click to vote
SOCO
2012
Springer
13 years 9 months ago
2012
Springer
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
105
click to vote
AAAI
2000
15 years 3 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
123
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...