Sciweavers

499 search results - page 50 / 100
» Model Minimization in Markov Decision Processes
Sort
View
QEST
2010
IEEE
13 years 6 months ago
Reasoning about MDPs as Transformers of Probability Distributions
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
Vijay Anand Korthikanti, Mahesh Viswanathan, Gul A...
JSAC
2007
73views more  JSAC 2007»
13 years 8 months ago
Optimal Wavelength Sharing Policies in OBS Networks Subject to QoS Constraints
— We consider the general problem of optimizing the performance of OBS networks with multiple traffic classes subject to strict (absolute) QoS constraints in terms of the end-to...
Li Yang, George N. Rouskas
QEST
2008
IEEE
14 years 3 months ago
CaVi -- Simulation and Model Checking for Wireless Sensor Networks
CaVi provides a uniform interface to state-of-the-art simulation methods and formal verification methods for wireless sensor network. Simulation is suitable to examine the behavi...
Athanassios Boulis, Ansgar Fehnker, Matthias Fruth...
EWRL
2008
13 years 10 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin
AIPS
2006
13 years 10 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht