Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

82

NETWORKS
2010

favoriteEmaildiscussreport

112views Computer Networks» more NETWORKS 2010»

Almost sure asymptotic optimality for online routing and machine scheduling problems

15 years 12 days ago

Almost sure asymptotic optimality for online routing and machine scheduling problems

Download web.mit.edu

Patrick Jaillet, Michael R. Wagner

Real-time Traffic

Computer Networks | NETWORKS 2010 |

claim paper

Related Content

» ChannelAdaptive Optimal OFDMA Scheduling

» A Fluid Heuristic for Minimizing Makespan in Job Shops

» How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to ...

» The Online Target Date Assignment Problem

» Defensive Universal Learning with Experts

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	NETWORKS
Authors	Patrick Jaillet, Michael R. Wagner

Comments (0)