Sciweavers

46 search results - page 8 / 10
» Fully Dynamic Algorithms for Maintaining Shortest Paths Tree...
Sort
View
ANOR
2008
171views more  ANOR 2008»
13 years 7 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
EMNLP
2010
13 years 4 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
JNCA
2008
123views more  JNCA 2008»
13 years 7 months ago
Edge-limited scalable QoS flow set-up
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up with...
James Lembke, Byung Kyu Choi
ICC
2007
IEEE
150views Communications» more  ICC 2007»
14 years 1 months ago
Hybrid Protocol for Application Level Multicast for Live Video Streaming
—A hybrid protocol for application level multicast (HPAM) for live video streaming without native IP multicast support is proposed. HPAM exploits the simplicity and optimality of...
Chai Kiat Yeo, Bu-Sung Lee, Meng Hwa Er
PODC
1997
ACM
13 years 11 months ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...