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...
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...
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...
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...
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...