Back to Results
First PageMeta Content
Gittins index / Multi-armed bandit / Digital signal processing / Statistics / Decision theory / Design of experiments


Resource-Sharing in a Single Server with Time-Varying Capacity (Invited Paper) Urtzi Ayesta∗† , Martin Erausquin∗‡ , Peter Jacko∗ ∗ BCAM—Basque
Add to Reading List

Document Date: 2012-01-01 05:04:48


Open Document

File Size: 158,93 KB

Share Result on Facebook

City

Bilbao / /

Company

Rai / L. Peshkin L. P. / Queueing Systems / John Wiley & Sons / /

Country

Spain / /

/

Facility

University of Oxford / Bizkaia Technology Park Building / Plaza Bizkaia / /

IndustryTerm

channel-aware scheduling algorithms / processor sharing systems / approximate general solutions / energy minimization / shortest remaining processing time discipline / wireless systems / approximate solution / wireless data networks / heuristic solution / value iteration algorithm / therefore focus on proposing an approximate solution / /

Organization

Basque Center for Applied Mathematics / Foundation for Science / UC Berkeley / Basque Government / Department of Education / University of Oxford / /

Person

Peter Jacko / John Gittins / Lehendakari Agirre / Martin Erausquin / Rhonda Righter / /

Position

Dean / and C. Boutilier / scheduler / /

Product

Sony Ericsson P1i Smartphone / /

ProgrammingLanguage

Erlang / /

PublishedMedium

IEEE Transactions on Information Theory / /

Technology

channel-aware scheduling algorithms / value iteration algorithm / been obtained using the value iteration algorithm / /

SocialTag