Sciweavers

334 search results - page 44 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
CONCUR
2006
Springer
15 years 1 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger
AAAI
2006
14 years 11 months ago
Targeting Specific Distributions of Trajectories in MDPs
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
David L. Roberts, Mark J. Nelson, Charles Lee Isbe...
TRANSCI
2002
106views more  TRANSCI 2002»
14 years 9 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...
IWDC
2005
Springer
210views Communications» more  IWDC 2005»
15 years 3 months ago
Mobile Agent Based Message Communication in Large Ad Hoc Networks Through Co-operative Routing Using Inter-agent Negotiation at
:- The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form ad hoc networks paves the way for build...
Parama Bhaumik, Somprakash Bandyopadhyay
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 29 days ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...