2252 search results - page 157 / 451 » Lower Bounds for Dynamic Algorithms |
128
Voted
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
116
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
112
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
116
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
134
Voted
TCS
2008
15 years 3 months ago
2008
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...