Back to Results
First PageMeta Content
Computational complexity theory / Applied mathematics / Competitive analysis / K-server problem / Randomized algorithm / Metrical task system / Adversary model / Minimum spanning tree / Bin packing problem / Theoretical computer science / Online algorithms / Analysis of algorithms


Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2
Add to Reading List

Document Date: 2010-02-08 08:39:17

Open Document

File Size: 194,04 KB

Share Result on Facebook

City

Paris Diderot / /

Company

Metrical Task Systems / /

Country

France / Israel / /

Currency

pence / /

Facility

Tel Aviv University / University Paris Diderot / Before dwelling / University of Paris / /

IndustryTerm

Online Computation / deterministic algorithms / infinite processing cost / online problem / task systems / heavy server / deterministic online algorithm / distributed computing / zero processing cost / deterministic algorithm / online algorithm / classical online model / light server / deterministic online algorithms / computing / online algorithms / randomized online algorithm / classical online algorithms / model online algorithms / online problems / least processing cost / /

Organization

University of Paris / Israel Science Foundation / CNRS / Tel Aviv University / Tel Aviv / /

Person

Ai / /

/

Position

author / min-player / spy / task rt / range Rt / request rt / rt / max-player / /

ProvinceOrState

Rt+1 / /

Technology

online algorithm / randomized algorithm / online algorithms / randomized online algorithm / deterministic algorithm / deterministic online algorithm / classical online algorithms / deterministic online algorithms / model online algorithms / paging / 1 Introduction Online algorithms / /

SocialTag