| Document Date: 2007-08-30 04:41:30
Open Document File Size: 194,67 KBShare Result on Facebook
Company Z. / / Currency pence / / / Event FDA Phase / / Facility Indian Institute of Technology Delhi / / IndustryTerm on-line manner / smallest processing requirement / deterministic algorithms / unsplittable flow algorithm / on-line algorithms / deterministic on-line algorithm / web servers / good on-line algorithms / offline algorithm / Online Lower / off-line algorithm / poly-time algorithms / approximation algorithm / feasible solution / polynomial time algorithm / finish processing / optimum off-line algorithm / online algorithm / minimum processing times / on-line algorithm / grid computing / fractional solution / on-line scheduling / polynomial time logarithmic approximation algorithm / integral solution / / Organization Indian Institute of Technology Delhi / / Product g(I) / Ii0 / / Technology online algorithm / off-line algorithm / good on-line algorithms / polynomial time logarithmic approximation algorithm / on-line algorithms / polynomial time algorithm / approximation algorithm / DGG algorithm / deterministic on-line algorithm / on-line algorithm / unsplittable flow algorithm / poly-time algorithms / scheduling algorithm / optimum off-line algorithm / offline algorithm / /
SocialTag |
Minimizing Average Flow-time : Upper and Lower Bounds Naveen Garg Amit Kumar