The World is Fat
- 作者Popkin, Barry M.
- 卷第297卷
- 期第3期
- 印刷ISSN0036-8733
- 文件大小1824.09KB
- 发表时间2007
- DOI10.1038/scientificamerican0907-88
- 页码88-95
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion timeTao, Jiping · Computers & Operations Research · 2014
567: Building a better Bishop: using machine learning to develop real-time cesarean delivery predictionsWong, Melissa S.; Wells, Matthew; Gregory, Kimberly D. · American Journal of Obstetrics and Gynecology · 2020
Competitive Analysis of a Better On-line Algorithm to Minimize Total Completion Time on a Single-machineJairo R. Montoya-Torres · Journal of Global Optimization · 2003
Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”Jiping Tao; Zhijun Chao; Yugeng Xi · 2011
[IEEE 2012 International Conference on Computer Communication and Informatics (ICCCI) - Coimbatore, India (2012.01.10-2012.01.12)] 2012 International Conference on Computer Communication and Informatics - Better alternative Run-Time Polymorphism in C++: A practical approach in OO design for machine intelligenceNath, Singh Paras; Vikram, Singh; Anand, Kumar · 2012