Sciweavers

173 search results - page 1 / 35
» The Fastest and Shortest Algorithm for All Well-Defined Prob...
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 4 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
IPPS
1998
IEEE
13 years 8 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera
ICRA
2008
IEEE
136views Robotics» more  ICRA 2008»
13 years 10 months ago
Generalizing the dubins and reeds-shepp cars: Fastest paths for bounded-velocity mobile robots
— What is the shortest or fastest path a mobile robot can follow between two configurations in the unobstructed plane? The answer to this fundamental question is only known anal...
Andrei A. Furtuna, Devin J. Balkcom, Hamid Reza Ch...
PPSN
2010
Springer
13 years 2 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
FOCS
1991
IEEE
13 years 7 months ago
On the Exponent of the All Pairs Shortest Path Problem
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
Noga Alon, Zvi Galil, Oded Margalit