Sciweavers

2714 search results - page 448 / 543
» Approximation Schemes for Scheduling
Sort
View
ICMCS
2010
IEEE
236views Multimedia» more  ICMCS 2010»
15 years 1 months ago
Practical algorithm for minimum delay peer-to-peer media streaming
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
Jun Luo
100
Voted
ICASSP
2010
IEEE
15 years 25 days ago
Simulating dynamic communication systems using the core functional dataflow model
The latest communication technologies invariably consist of modules with dynamic behavior. There exists a number of design tools for communication system design with their foundat...
Nimish Sane, Chia-Jui Hsu, José Luis Pino, ...
129
Voted
ICFP
2010
ACM
15 years 25 days ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
116
Voted
COR
2010
177views more  COR 2010»
15 years 23 days ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
101
Voted
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 22 days ago
Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks
Abstract-- In this paper, we analyze asymptotic delaythroughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spat...
Michele Garetto, Emilio Leonardi