10608 search results - page 549 / 2122 » Complexity of O'Hara's Algorithm |
183
click to vote
CAIP
2007
Springer
15 years 11 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
213
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
146
click to vote
CIARP
2008
Springer
15 years 9 months ago
2008
Springer
This report1 considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by l...
156
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
170
click to vote
CCCG
2008
15 years 8 months ago
2008
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...