Sciweavers

7228 search results - page 172 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
137
Voted
WOSP
2005
ACM
15 years 9 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
117
Voted
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
15 years 7 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 4 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
MCS
2007
Springer
15 years 10 months ago
Cooperative Coevolutionary Ensemble Learning
Abstract. A new optimization technique is proposed for classifiers fusion — Cooperative Coevolutionary Ensemble Learning (CCEL). It is based on a specific multipopulational evo...
Daniel Kanevskiy, Konstantin Vorontsov
155
Voted
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 3 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev