882 search results - page 90 / 177 » Local Search for Very Large SAT Problems |
113
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
120
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
147
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
148
click to vote
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
116
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...