693 search results - page 4 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
AAAI
1998
15 years 1 months ago
1998
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
JAIR
2007
14 years 11 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
CP
2007
Springer
15 years 5 months ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...