614 search results - page 2 / 123 » Local Computation: Lower and Upper Bounds |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
COR
2008
13 years 7 months ago
2008
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
UMC
2000
13 years 11 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
UAI
1996
13 years 8 months ago
1996
