Sciweavers

5580 search results - page 837 / 1116
» Randomized priority algorithms
Sort
View
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 8 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
INFOCOM
2003
IEEE
15 years 8 months ago
Exploiting Multiuser Diversity for Medium Access Control in Wireless Networks
— Multiuser diversity refers to a type of diversity present across different users in a fading environment. This diversity can be exploited by scheduling transmissions so that us...
Xiangping Qin, Randall A. Berry
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 8 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
ADAEUROPE
2003
Springer
15 years 8 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 7 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra