48 search results - page 3 / 10 » An Average Analysis of Backtracking on Random Constraint Sat... |
FLAIRS
2007
13 years 9 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
PROCEDIA
2011
12 years 10 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
JAIR
2007
13 years 7 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...
AAAI
2006
13 years 8 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...