8431 search results - page 114 / 1687 » Algorithmically Independent Sequences |
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We demonstrate an approach for collision- and oscillationfree navigation of multiple robots or virtual agents amongst each other. Each entity acts independently and uses only both...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
ADVIS
2000
Springer
15 years 2 months ago
2000
Springer
Modern applications demand support for a large number of clients and require large scale storage subsystems. This paper presents a theoretical model of prefetching and caching of s...
AI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...