![Computational complexity theory / Online algorithms / Algorithm / Competitive analysis / Best / worst and average case / Asymptotically optimal algorithm / Approximation algorithm / Theoretical computer science / Applied mathematics / Analysis of algorithms Computational complexity theory / Online algorithms / Algorithm / Competitive analysis / Best / worst and average case / Asymptotically optimal algorithm / Approximation algorithm / Theoretical computer science / Applied mathematics / Analysis of algorithms](https://www.pdfsearch.io/img/c69595bebd7733ff7e0c46967b99c046.jpg)
| Document Date: 2006-02-03 21:38:13 Open Document File Size: 387,90 KBShare Result on Facebook
Company Akamai / / Facility MASSACHUSETTS INSTITUTE OF TECHNOLOGY June / Massachusetts Institute of Technology / / IndustryTerm deterministic adaptive algorithms / instance-optimal algorithms / adaptive algorithms / adaptive algorithm / instance-optimal algorithm / good adaptive algorithms / online algorithm / bestpossible algorithm / near-optimal adaptive algorithm / / Organization Department Committee on Graduate Students / Massachusetts Institute of Technology / Department of Electrical Engineering and Computer Science / / Person Ilya Baran / Arthur C. Smith / Ilya Baran Submitted / Thesis Supervisor / Erik D. Demaine / Thesis Supervisor Accepted / / Position Author / Supervisor / advisor / Chairman / evaluator / Assistant Professor / / ProvinceOrState Massachusetts / / Technology good adaptive algorithms / optimally adaptive algorithms / online algorithm / 2 Adaptive Algorithms / 1.1 Adaptive Algorithms Algorithms / 7 1.1 Adaptive Algorithms / deterministic adaptive algorithms / optimally adaptive algorithm / bestpossible algorithm / adaptive algorithm / 43 4.3 Noisy Algorithm / /
SocialTag |