693 search results - page 9 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
116
click to vote
CSR
2010
Springer
15 years 6 months 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). ...
101
click to vote
GLVLSI
2003
IEEE
15 years 7 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
119
click to vote
CP
1999
Springer
15 years 6 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
104
click to vote
CP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
156
click to vote
EC
2007
15 years 1 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...