Sciweavers

13414 search results - page 349 / 2683
» The distributed boosting algorithm
Sort
View
IPPS
1997
IEEE
15 years 11 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
BMCBI
2007
86views more  BMCBI 2007»
15 years 6 months ago
Detecting microsatellites within genomes: significant variation among algorithms
Background: Microsatellites are short, tandemly-repeated DNA sequences which are widely distributed among genomes. Their structure, role and evolution can be analyzed based on exh...
Sébastien Leclercq, Eric Rivals, Philippe J...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 28 days ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
ATAL
2005
Springer
16 years 9 days ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
IPPS
1999
IEEE
15 years 11 months ago
Better Deterministic Routing on Meshes
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
Jop F. Sibeyn