2084 search results - page 327 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
COCOON
2003
Springer
15 years 3 months ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
131
click to vote
ISM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute band...
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
COCO
1998
Springer
15 years 2 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
SPAA
1997
ACM
15 years 2 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...