Sciweavers

135 search results - page 6 / 27
» Dynamic Workflow Composition using Markov Decision Processes
Sort
View
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 6 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
NIPS
2000
13 years 10 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier
ESWS
2004
Springer
14 years 20 days ago
A Framework for Automated Service Composition in Service-Oriented Architectures
Abstract. Automated service composition refers to automating the entire process of composing a workflow. This involves automating the discovery and selection of the service, ensuri...
Shalil Majithia, David W. Walker, W. A. Gray
AIPS
2006
13 years 10 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
PERCOM
2006
ACM
14 years 8 months ago
On the Fly Service Composition for Local Interaction Environments
Dynamically creating new, composite services "on the fly" using existing ones in a local interaction environment (e.g. a home, meeting room, airport lounge, etc.) presen...
Hossein Pourreza, Peter Graham