Sciweavers

334 search results - page 32 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
ICC
2007
IEEE
15 years 4 months ago
Dynamic Lightpath Establishment for Service Differentiation Based on Optimal MDP Policy in All-Optical Networks with Wavelength
— In this paper, we propose a dynamic lightpath establishment method for service differentiation in all-optical WDM networks with the capability of full-range wavelength conversi...
Takuji Tachibana, Shoji Kasahara, Kenji Sugimoto
71
Voted
HICSS
2006
IEEE
114views Biometrics» more  HICSS 2006»
15 years 3 months ago
Game Theoretical Analysis of Cooperative Sourcing Scenarios
As an emerging trend in outsourcing, cooperative sourcing is the merging of similar processes of several firms when, for example, several banks merge their payments processing and...
Daniel Beimborn, Hermann-Josef Lamberti, Tim Weitz...
UAI
2003
14 years 11 months ago
Symbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein
DATE
2004
IEEE
145views Hardware» more  DATE 2004»
15 years 1 months ago
Hierarchical Adaptive Dynamic Power Management
Dynamic power management aims at extending battery life by switching devices to lower-power modes when there is a reduced demand for service. Static power management strategies can...
Zhiyuan Ren, Bruce H. Krogh, Radu Marculescu
AIPS
1998
14 years 11 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim