2084 search results - page 150 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
151
click to vote
AIMSA
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
146
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
142
click to vote
ICPR
2000
IEEE
16 years 6 months ago
2000
IEEE
Speech can be represented as a time/frequency distribution of energy using a multi-band filter bank. A Markov random field model, which takes into account the possible time asynch...
130
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
160
click to vote
NOSSDAV
2009
Springer
15 years 11 months ago
2009
Springer
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...