Sciweavers

940 search results - page 10 / 188
» Control Abstractions for Local Search
Sort
View
AUSAI
2004
Springer
14 years 23 days ago
Longer-Term Memory in Clause Weighting Local Search for SAT
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
Valnir Ferreira Jr., John Thornton
ANTSW
2008
Springer
13 years 8 months ago
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
Frank Neumann, Dirk Sudholt, Carsten Witt
CEC
2009
IEEE
14 years 2 months ago
Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems
Abstract— Evolutionary multi-objective optimization algorithms are commonly used to obtain a set of non-dominated solutions for over a decade. Recently, a lot of emphasis have be...
Karthik Sindhya, Ankur Sinha, Kalyanmoy Deb, Kaisa...
CPAIOR
2007
Springer
14 years 1 months ago
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
Sivan Sabato, Yehuda Naveh
CP
2006
Springer
13 years 11 months ago
Inferring Variable Conflicts for Local Search
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...
Magnus Ågren, Pierre Flener, Justin Pearson