Sciweavers

1830 search results - page 272 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
CEC
2007
IEEE
15 years 4 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
TWC
2008
117views more  TWC 2008»
14 years 9 months ago
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
Alireza Ghaderipoor, Chintha Tellambura
ISPD
1998
ACM
97views Hardware» more  ISPD 1998»
15 years 2 months ago
Device-level early floorplanning algorithms for RF circuits
—High-frequency circuits are notoriously difficult to lay out because of the tight coupling between device-level placement and wiring. Given that successful electrical performan...
Mehmet Aktuna, Rob A. Rutenbar, L. Richard Carley
BMCBI
2005
119views more  BMCBI 2005»
14 years 9 months ago
GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures
Background: We introduce GASH, a new, publicly accessible program for structural alignment and superposition. Alignments are scored by the Number of Equivalent Residues (NER), a q...
Daron M. Standley, Hiroyuki Toh, Haruki Nakamura
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
15 years 1 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood