12015 search results - page 342 / 2403 » Interactive Algorithms 2005 |
126
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
129
Voted
ECAL
2005
Springer
15 years 9 months ago
2005
Springer
This paper investigates genetic drift in multi-parent genetic algorithms (MPGAs). An exact model based on Markov chains is proposed to formulate the variation of gene frequency. Th...
127
Voted
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our appro...
122
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
The Internet is different from traditional parallel computing environments, and Distributed Genetic Algorithms (DGAs) for the Internet need to be designed to address these diffe...
111
click to vote
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...