Sciweavers

2252 search results - page 265 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
129
Voted
RTSS
2000
IEEE
15 years 8 months ago
A User-Customizable Energy-Adaptive Combined Static/Dynamic Scheduler for Mobile Applications
In portable applications, the energy consumed by OS and application tasks primarily comes from DC battery source, which is limited and imposes an upper bound to the amount of time...
Trolan C. L. Ma, Kang G. Shin
148
Voted
NIPS
2004
15 years 5 months ago
Experts in a Markov Decision Process
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
Eyal Even-Dar, Sham M. Kakade, Yishay Mansour
131
Voted
ICML
2009
IEEE
16 years 4 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri
DATE
2010
IEEE
261views Hardware» more  DATE 2010»
15 years 8 months ago
Evaluation and design exploration of solar harvested-energy prediction algorithm
Abstract—To respond to variations in solar energy, harvestedenergy prediction is essential to harvested-energy management approaches. The effectiveness of such approaches is depe...
Mustafa Imran Ali, Bashir M. Al-Hashimi, Joaqu&iac...
140
Voted
ATAL
2009
Springer
15 years 10 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...