Sciweavers

854 search results - page 121 / 171
» A General Vehicle Routing Problem
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 8 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
INFOCOM
2009
IEEE
14 years 2 months ago
SDL Constructions of FIFO, LIFO and Absolute Contractors
— Despite all the recent advances in the mathematical theories for constructing optical queues by optical Switches and fiber Delay Lines (SDL), there are still many problems tha...
Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee
TIT
2008
112views more  TIT 2008»
13 years 7 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar
NOSSDAV
2004
Springer
14 years 1 months ago
Managing a portfolio of overlay paths
In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneou...
Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ra...
DAC
2009
ACM
14 years 8 months ago
Handling don't-care conditions in high-level synthesis and application for reducing initialized registers
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo