Sciweavers

1257 search results - page 233 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Optimal Pricing in a Free Market Wireless Network
We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dyna...
Michael J. Neely
ADC
2007
Springer
145views Database» more  ADC 2007»
15 years 4 months ago
Selectivity Estimation by Batch-Query based Histogram and Parametric Method
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
Jizhou Luo, Xiaofang Zhou, Yu Zhang, Heng Tao Shen...
HOTI
2005
IEEE
15 years 3 months ago
Addressing Queuing Bottlenecks at High Speeds
Modern routers and switch fabrics can have hundreds of input and output ports running at up to 10 Gb/s; 40 Gb/s systems are starting to appear. At these rates, the performance of ...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley
ATAL
2005
Springer
15 years 3 months ago
Liberalizing protocols for argumentation in multi-agent systems
This publication summarizes research on the the design and implementation of liberalized version of existing truth-finding protocols for argumentation, such as the standard two-a...
Gerard Vreeswijk
MOBICOM
2004
ACM
15 years 3 months ago
SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks
Capacity improvement is one of the principal challenges in wireless networking. We present a link-layer protocol called Slotted Seeded Channel Hopping, or SSCH, that increases the...
Paramvir Bahl, Ranveer Chandra, John Dunagan