1257 search results - page 233 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
112
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
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...
127
click to vote
ADC
2007
Springer
15 years 10 months ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
123
click to vote
HOTI
2005
IEEE
15 years 9 months ago
2005
IEEE
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 ...
134
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
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...
125
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
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...