Sciweavers

14078 search results - page 212 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
15 years 7 months ago
Crossover can provably be useful in evolutionary computation
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
Benjamin Doerr, Edda Happ, Christian Klein
BMCBI
2010
108views more  BMCBI 2010»
15 years 6 months ago
Confronting two-pair primer design for enzyme-free SNP genotyping based on a genetic algorithm
Background: Polymerase chain reaction with confronting two-pair primers (PCR-CTPP) method produces allelespecific DNA bands of different lengths by adding four designed primers an...
Cheng-Hong Yang, Yu-Huei Cheng, Li-Yeh Chuang, Hsu...
CAIP
2001
Springer
15 years 11 months ago
A Simple Algorithm for Ordering and Compression of Vector Codebooks
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies ...
Maciej Bartkowiak, Adam Luczak
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 11 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
15 years 4 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...