Sciweavers

3110 search results - page 105 / 622
» On the initialization of the DNMF algorithm
Sort
View
PODC
2009
ACM
16 years 5 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
CEC
2009
IEEE
15 years 11 months ago
A clustering multi-objective evolutionary algorithm based on orthogonal and uniform design
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...
Yuping Wang, Chuangyin Dang, Hecheng Li, Lixia Han...
113
Voted
CEC
2007
IEEE
15 years 11 months ago
A cost benefit operator for efficient multi level genetic algorithm searches
— In this paper we present a novel cost benefit operator that assists multi level genetic algorithm searches. Through the use of the cost benefit operator, it is possible to dyna...
George G. Mitchell, Barry McMullin, James Decraene
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
15 years 11 months ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
FOCS
2006
IEEE
15 years 11 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee