Sciweavers

236 search results - page 21 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu
COCOON
2008
Springer
15 years 7 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
IOR
2007
82views more  IOR 2007»
15 years 6 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
INFOCOM
2008
IEEE
16 years 13 days ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves
INFOCOM
2008
IEEE
16 years 13 days ago
HERO: Online Real-Time Vehicle Tracking in Shanghai
—Intelligent transportation systems have become increasingly important for the public transportation in Shanghai. In response, ShanghaiGrid (SG) aims to provide abundant intellig...
Hongzi Zhu, Yanmin Zhu, Minglu Li, Lionel M. Ni