Sciweavers

1921 search results - page 383 / 385
» The Student-Project Allocation Problem
Sort
View
TON
1998
103views more  TON 1998»
13 years 7 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar
TSMC
2002
100views more  TSMC 2002»
13 years 7 months ago
A LP-RR principle-based admission control for a mobile network
Abstract--In mobile networks, the traffic fluctuation is unpredictable due to mobility and varying resource requirement of multimedia applications. Hence, it is essential to mainta...
B. P. Vijay Kumar, P. Venkataram
IOR
2010
114views more  IOR 2010»
13 years 6 months ago
Inventory Management of a Fast-Fashion Retail Network
Working in collaboration with Spain-based retailer Zara, we address the problem of distributing over time a limited amount of inventory across all the stores in a fast-fashion ret...
Felipe Caro, Jérémie Gallien
VTC
2010
IEEE
158views Communications» more  VTC 2010»
13 years 6 months ago
QoS and Flow Management for Future Multi-Hop Mobile Radio Networks
Abstract— Mobile radio networks of the IMT-Advanced systems family promise ubiquitous broadband access and high area coverage, with rates of several 100 MBit/s. They claim to gua...
Rainer Schoenen, Arif Otyakmaz
WINET
2010
105views more  WINET 2010»
13 years 6 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...