400 search results - page 19 / 80 » Backtracking |
AAAI
2007
14 years 2 days ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
AAAI
2006
13 years 11 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
AAAI
1996
13 years 11 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
DM
2008
13 years 9 months ago
2008
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
CADE
2001
Springer
14 years 10 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...