693 search results - page 10 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
127
click to vote
COR
2010
15 years 1 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
87
Voted
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
107
click to vote
PUK
2000
15 years 3 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
106
click to vote
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
112
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...