2084 search results - page 108 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
127
Voted
JSAC
2007
15 years 2 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
104
Voted
ICNP
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
148
Voted
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
159
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
128
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...