2252 search results - page 23 / 451 » Lower Bounds for Dynamic Algorithms |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
AAAI
2006
13 years 9 months ago
2006
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
SIAMCOMP
2010
13 years 2 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...