2168 search results - page 231 / 434 » Randomized Algorithms and Complexity Theory |
105
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In this paper, two problems related to the simulation of virtual environments for haptic systems are considered. The first problem is how to simulate, in discrete time...
146
Voted
ESA
1998
Springer
15 years 8 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
124
click to vote
TALG
2010
15 years 2 months ago
2010
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
152
Voted
TALG
2008
15 years 3 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
111
Voted
ITNG
2007
IEEE
15 years 10 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...