Sciweavers

4007 search results - page 764 / 802
» Computation with imprecise probabilities
Sort
View
ANCS
2005
ACM
14 years 1 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
MSWIM
2005
ACM
14 years 1 months ago
Non-saturation and saturation analysis of IEEE 802.11e EDCA with starvation prediction
An analytical model is proposed to describe the priority schemes of the EDCA mechanism of the IEEE 802.11e standard. EDCA provides class-based differentiated QoS to IEEE 802.11 WL...
Paal Engelstad, Olav N. Østerbø
SENSYS
2005
ACM
14 years 1 months ago
Sympathy for the sensor network debugger
Being embedded in the physical world, sensor networks present a wide range of bugs and misbehavior qualitatively different from those in most distributed systems. Unfortunately, d...
Nithya Ramanathan, Kevin K. Chang, Rahul Kapur, Le...
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...