Sciweavers

CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 3 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 3 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 3 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
ENGL
2006
170views more  ENGL 2006»
13 years 3 months ago
Hybrid Genetic Algorithms: A Review
Hybrid genetic algorithms have received significant interest in recent years and are being increasingly used to solve real-world problems. A genetic algorithm is able to incorporat...
Tarek A. El-Mihoub, Adrian A. Hopgood, Lars Nolle,...
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 3 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
EC
2008
146views ECommerce» more  EC 2008»
13 years 3 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
DAM
2008
115views more  DAM 2008»
13 years 3 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
EC
2010
157views ECommerce» more  EC 2010»
13 years 3 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
COR
2008
99views more  COR 2008»
13 years 3 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
BMCBI
2010
116views more  BMCBI 2010»
13 years 3 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel