15033 search results - page 73 / 3007 » Complexity Theory and Algorithms |
131
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
147
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
129
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
129
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
158
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...