Sciweavers

1628 search results - page 103 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
ATAL
2008
Springer
15 years 1 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings
IPPS
2005
IEEE
15 years 4 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 3 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
AE
2007
Springer
15 years 5 months ago
A Study of Crossover Operators for Gene Selection of Microarray Data
Classification of microarray data requires the selection of a subset of relevant genes in order to achieve good classification performance. Several genetic algorithms have been d...
Jose Crispin Hernandez Hernandez, Béatrice ...
IEAAIE
2005
Springer
15 years 4 months ago
The Coordination of Parallel Search with Common Components
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of commo...
Stephen Chen, Gregory Pitt