Sciweavers

2266 search results - page 111 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
GECCO
2009
Springer
15 years 5 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
CEC
2008
IEEE
15 years 8 months ago
High-level synthesis with multi-objective genetic algorithm: A comparative encoding analysis
— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...
Christian Pilato, Daniele Loiacono, Fabrizio Ferra...
108
Voted
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 1 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
EVOW
2004
Springer
15 years 7 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
GCC
2003
Springer
15 years 7 months ago
An Evolutionary Constraint Satisfaction Solution for over the Cell Channel Routing
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
Ahmet Ünveren, Adnan Acan