Sciweavers

515 search results - page 11 / 103
» Approximating Markov Processes by Averaging
Sort
View
IJCAI
2007
13 years 8 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe
QUESTA
1998
93views more  QUESTA 1998»
13 years 7 months ago
An approximation method for complete solutions of Markov-modulated fluid models
This paper presents an approximation method for numerically solving general Markov modulated fluid models which are widely used in modelling communications and computer systems. ...
David D. McDonald, Kun Qian
BIRTHDAY
2009
Springer
13 years 11 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
FOCS
2007
IEEE
13 years 11 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
DMIN
2009
142views Data Mining» more  DMIN 2009»
13 years 5 months ago
Action Selection in Customer Value Optimization: An Approach Based on Covariate-Dependent Markov Decision Processes
Typical methods in CRM marketing include action selection on the basis of Markov Decision Processes with fixed transition probabilities on the one hand, and scoring customers separ...
Angi Roesch, Harald Schmidbauer