318 search results - page 4 / 64 » On the Computational Power of 1-Deterministic and Sequential... |
STOC
2004
ACM
14 years 1 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
SIAMSC
2010
13 years 7 months ago
2010
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is...
DLT
2010
13 years 10 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
AAAI
2006
13 years 10 months ago
2006
Teams of robots are more fault tolerant than single robots, and auctions appear to be promising means for coordinating them. In a recent paper at "Robotics: Science and Syste...