搜索结果: 1-2 共查到“运筹学 online”相关记录2条 . 查询时间(0.062 秒)
Online over time scheduling on unbounded p-batch machines to minimize the makespan: A survey
operation sresearch online scheduling parallel-batch machines makespan competitive ratio
2011/11/14
Online scheduling is a rapidly developed branch in scheduling theory. In the research of online scheduling, makespan minimization on unbounded parallel-batch machines is a fruitful area. In this paper...
Optimal Distributed Online Prediction using Mini-Batches
distributed learning online learning stochastic optimization
2011/3/2
Online prediction methods are typically presented as serial algorithms running on a single
processor. However, in the age of web-scale prediction problems, it is increasingly common
to encounter sit...