Sciweavers

625 search results - page 49 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
137
Voted
AGENTS
2001
Springer
15 years 8 months ago
An auction-based method for decentralized train scheduling
We present a computational study of an auction-based method for decentralized train scheduling. The method is well suited to the natural information and control structure of moder...
David C. Parkes, Lyle H. Ungar
158
Voted
TMC
2012
13 years 5 months ago
E-MiLi: Energy-Minimizing Idle Listening in Wireless Networks
WiFi interface is known to be a primary energy consumer in mobile devices, and idle listening (IL) is the dominant source of energy consumption in WiFi. Most existing protocols, s...
Xinyu Zhang, Kang G. Shin
153
Voted
TMC
2008
180views more  TMC 2008»
15 years 3 months ago
OS-MAC: An Efficient MAC Protocol for Spectrum-Agile Wireless Networks
Wireless networks and devices have rapidly been gaining popularity over their wired counterparts. This popularity, in turn, has been generating an explosive and ever-increasing dem...
Bechir Hamdaoui, Kang G. Shin
121
Voted
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 9 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
PE
2006
Springer
125views Optimization» more  PE 2006»
15 years 3 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot