Sciweavers

16093 search results - page 302 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
143
Voted
MOBIHOC
2003
ACM
16 years 6 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 7 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
NIPS
2001
15 years 8 months ago
A General Greedy Approximation Algorithm with Applications
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
T. Zhang
EMO
2003
Springer
109views Optimization» more  EMO 2003»
15 years 12 months ago
A Population and Interval Constraint Propagation Algorithm
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
Vincent Barichard, Jin-Kao Hao
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
16 years 4 days ago
A Cooperative Coevolutionary Multiobjective Algorithm Using Non-dominated Sorting
The following paper describes a cooperative coevolutionary algorithm which incorporates a novel collaboration formation mechanism. It encourages rewarding of components participati...
Antony W. Iorio, Xiaodong Li