Back to Results
First PageMeta Content
Applied mathematics / Cache / Page replacement algorithm / Virtual memory / Randomized algorithm / Fast Fourier transform / Algorithm / Asymptotically optimal algorithm / Cache-oblivious algorithm / Analysis of algorithms / Mathematics / Theoretical computer science


540 Caching with Expiration Times Paxikshit Gopalan" Howard Karlofft
Add to Reading List

Document Date: 2002-08-26 13:46:55


Open Document

File Size: 729,07 KB

Share Result on Facebook

City

Boulder / San Diego / L.A. / /

Company

IBM / Fiat / PWS Publishing Company / Cambridge University Press / iTT / 1AT&T Research Labs. / Next Generation Telecommunications / CNN / /

Facility

§Georgia Institute of Technology / tGeorgia Institute / ex~rgia Institute / Plinceton University / /

IndustryTerm

last / mobile telecommunication services / namely marking algorithms / classical marking algorithms / flow-based polynomial time algorithm / offline algorithm / mobile telecommunications / approximation algorithm / marking algorithms / deterministic marking algorithms / mobile and personal communications services / above algorithm / randomized online marking algorithm / ofitine algorithm / randomized marking algorithms / randomized marking algorithm / distributed information applications / online scenario / offiine algorithm / online algorithm;see / deterministic online algorithm / mobile devices / online algorithm / telephony expiration times / Online Marking Algorithms / deterministic online algorithms / online algorithms / Online In / /

Organization

Cambridge University / National Science Foundation / MIT / Institute of Technology / American Cancer Society / /

Person

Tamra Carpenter / Vijay Vazirani / Milena Mihail / Ai / Susanne Albers / Jia Wang / Robert L. Carter / Elias Koutsoupias / Martin Eiger / /

/

Position

Cao at ~d C. Liu / cache manager / Carpenter / /

Product

Franklin / /

ProvinceOrState

Wisconsin / California / Colorado / /

PublishedMedium

Theory of Computing / /

Technology

online algorithm / least Any algorithm / above algorithm / following algorithm / flow-based polynomial time algorithm / t-1 / classical marking algorithms / deterministic online algorithm / deterministic online algorithms / PCS / Operating Systems / ofitine algorithm / randomized online marking algorithm / mobile devices / so-called marking algorithms / DNS / deterministic marking algorithms / 3 approximation algorithm / http / paging / Data Caching / Caching / randomized marking algorithm / 3 Deterministic Online Marking Algorithms / namely marking algorithms / randomized marking algorithms / t - 1 / /

URL

suid.nlanr.net / http /

SocialTag