2168 search results - page 370 / 434 » Randomized Algorithms and Complexity Theory |
118
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
136
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
158
click to vote
IPSN
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
149
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
137
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...