5316 search results - page 19 / 1064 » Which Search Problems Are Random |
81
Voted
IJCAI
1993
15 years 2 months ago
1993
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
120
Voted
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
We address the problem of parameter estimation in presence
of both uncertainty and outlier noise. This is a common
occurrence in computer vision: feature localization
is perform...
93
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
91
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
JAIR
2000
15 years 13 days ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...