Sciweavers

715 search results - page 58 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
BMCBI
2005
122views more  BMCBI 2005»
14 years 9 months ago
GenClust: A genetic algorithm for clustering gene expression data
Background: Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designe...
Vito Di Gesù, Raffaele Giancarlo, Giosu&egr...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 2 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 4 months ago
Takeover times on scale-free topologies
The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of inter-individual interactions affects th...
Joshua L. Payne, Margaret J. Eppstein
IJCAI
2007
14 years 11 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen
DIALM
1999
ACM
127views Algorithms» more  DIALM 1999»
15 years 2 months ago
The performance of query control schemes for the zone routing protocol
—In this paper, we study the performance of route query control mechanisms for the Zone Routing Protocol (ZRP) for ad hoc networks. ZRP proactively maintains routing information ...
Zygmunt J. Haas, Marc R. Pearlman