Sciweavers

1595 search results - page 7 / 319
» An Evolutionary Local Search Algorithm for the Satisfiabilit...
Sort
View
IJCAI
2001
13 years 8 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
LION
2009
Springer
136views Optimization» more  LION 2009»
14 years 2 months ago
Fitness Landscape Analysis for the Resource Constrained Project Scheduling Problem
The fitness landscape of the resource constrained project scheduling problem is investigated by examining the search space position type distribution and the correlation between t...
Jens Czogalla, Andreas Fink
AAAI
2000
13 years 8 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
GECCO
2004
Springer
112views Optimization» more  GECCO 2004»
14 years 25 days ago
Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimization
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...
Hisao Ishibuchi, Kaname Narukawa
CEC
2007
IEEE
13 years 7 months ago
Designing memetic algorithms for real-world applications using self-imposed constraints
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
Thomas Michelitsch, Tobias Wagner, Dirk Biermann, ...