Sciweavers

197 search results - page 11 / 40
» Answering complex questions with random walk models
Sort
View
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 4 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
15 years 2 months ago
Designing Complex Software Implementation Programs
The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of ...
Pieter M. A. Ribbers, Klaus-Clemens Schoo
CAV
2001
Springer
154views Hardware» more  CAV 2001»
15 years 1 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
INFOCOM
2008
IEEE
15 years 3 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
15 years 6 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG