5115 search results - page 258 / 1023 » On Randomized Lanczos Algorithms |
172
click to vote
ATAL
2004
Springer
16 years 17 days ago
2004
Springer
Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multiagent systems. It involves monitoring the routine conversations of agent...
207
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
192
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
284
click to vote
DCOSS
2011
Springer
14 years 7 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
191
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...