Sciweavers

22 search results - page 3 / 5
» Evolution of an Efficient Search Algorithm for the Mate-In-N...
Sort
View
APIN
2000
120views more  APIN 2000»
13 years 6 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
BMCBI
2010
135views more  BMCBI 2010»
13 years 6 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 10 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
WWW
2006
ACM
14 years 7 months ago
Visualizing tags over time
We consider the problem of visualizing the evolution of tags within the Flickr (flickr.com) online image sharing community. Any user of the Flickr service may append a tag to any ...
Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine...
EAAI
2006
189views more  EAAI 2006»
13 years 6 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...