219 search results - page 27 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
PODS
2012
ACM
11 years 11 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
SIAMCOMP
2000
13 years 8 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
CONCUR
1999
Springer
14 years 28 days ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
ICRA
2008
IEEE
14 years 3 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...