328 search results - page 37 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
CEC
2008
IEEE
13 years 9 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
CCCG
2003
13 years 9 months ago
2003
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...