AUSAI
2007
Springer
14 years 2 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...
GECCO
2010
Springer
14 years 2 months ago
2010
Springer
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD . Recently, ...
CADE
1998
Springer
14 years 3 months ago
1998
Springer
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
KI
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
SAGA
2001
Springer
14 years 3 months 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 ...
ROBOCUP
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. This paper describes a two-tiered approach to the self-localization problem for soccer playing robots using generic off-the-shelf color cameras. The solution consists of...
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
CSR
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
TIME
2002
IEEE
14 years 3 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
SSIAI
2002
IEEE
14 years 3 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...