313 search results - page 38 / 63 » Complete Local Search with Memory |
AAAI
2007
14 years 6 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...
ICRA
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents a general framework for planning the quasi-static motion of a three-limbed climbing robot in vertical natural terrain. The problem is to generate a sequence of...
CP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
BIBE
2005
IEEE
14 years 3 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...