Sciweavers

449 search results - page 7 / 90
» Evolutionary Approaches to Linear Ordering Problem
Sort
View
BMCBI
2006
159views more  BMCBI 2006»
13 years 7 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
PPSN
2004
Springer
14 years 21 days ago
A Hybrid GRASP - Evolutionary Algorithm Approach to Golomb Ruler Search
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...
Carlos Cotta, Antonio J. Fernández
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
13 years 11 months ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
13 years 8 months ago
A novel methodology for diversity preservation in evolutionary algorithms
In this paper we describe an improvement of an entropy-based diversity preservation approach for evolutionary algorithms. This approach exploits the information contained not only...
Giovanni Squillero, Alberto Paolo Tonda
COCOA
2007
Springer
14 years 1 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle