1041 search results - page 94 / 209 » Randomizing Reductions of Search Problems |
SAGA
2001
Springer
14 years 11 days ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
STOC
1998
ACM
14 years 5 days ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
AIPS
2007
13 years 10 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
AUSAI
2007
Springer
13 years 12 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...