Sciweavers

376 search results - page 28 / 76
» Evaluating Heuristic Optimization Phase Order Search Algorit...
Sort
View
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
14 years 2 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
14 years 4 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
CEC
2008
IEEE
14 years 19 days ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
TEC
2002
163views more  TEC 2002»
13 years 10 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
EOR
2006
129views more  EOR 2006»
13 years 10 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano