Sciweavers

1040 search results - page 139 / 208
» Rounding algorithms for covering problems
Sort
View
ICC
2007
IEEE
136views Communications» more  ICC 2007»
15 years 4 months ago
TCP ACK Congestion Control and Filtering for Fairness Provision in the Uplink of IEEE 802.11 Infrastructure Basic Service Set
—Most of the deployed IEEE 802.11 Wireless Local Area Networks (WLANs) use infrastructure Basic Service Set (BSS) in which an Access Point (AP) serves as a gateway between wired ...
Feyza Keceli, Inanc Inan, Ender Ayanoglu
FORMATS
2005
Springer
15 years 3 months ago
Average Reward Timed Games
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...
B. Thomas Adler, Luca de Alfaro, Marco Faella
AINA
2003
IEEE
15 years 3 months ago
Detection of Multiple Bottleneck Bandwidth
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki
DSRT
2000
IEEE
15 years 2 months ago
Scheduling for Very Large Virtual Environments and Networked Games Using Visibility and Priorities
The problem of network bundwidth limitutions is encountered in ulmost uny distributed virtuul environment or networkedgume. In U typicul client-serversetup, where the virtuul worl...
Chris Faisstnauer, Dieter Schmalstieg, Werner Purg...
ICPP
1995
IEEE
15 years 1 months ago
Unicasting in Faulty Hypercubes Using Safety Levels
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
Jie Wu