18306 search results - page 348 / 3662 » Algorithmics in Exponential Time |
161
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
150
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— This paper compares two algorithms to solve a multiagent patrol problem with uncertain durations. The first algorithm is reactive and allows adaptive and robust behavior, whil...
137
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
166
click to vote
SPIRE
1999
Springer
15 years 11 months ago
1999
Springer
This work presents an e cient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows th...
159
click to vote
ECCC
2010
15 years 6 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...