2924 search results - page 302 / 585 » Lower Bounds in Distributed Computing |
208
click to vote
ISLPED
1996
ACM
15 years 8 months ago
1996
ACM
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
132
click to vote
SOFSEM
1997
Springer
15 years 8 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
171
click to vote
CG
2006
Springer
15 years 8 months ago
2006
Springer
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
116
click to vote
AAAI
2010
15 years 5 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
130
click to vote
ADHOCNOW
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication ch...