Sciweavers

4485 search results - page 117 / 897
» Equivalences on Observable Processes
Sort
View
UAI
2003
13 years 11 months ago
Implementation and Comparison of Solution Methods for Decision Processes with Non-Markovian Rewards
This paper examines a number of solution methods for decision processes with non-Markovian rewards (NMRDPs). They all exploit a temporal logic specification of the reward functio...
Charles Gretton, David Price, Sylvie Thiéba...
FAC
2008
114views more  FAC 2008»
13 years 10 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
TIP
2010
119views more  TIP 2010»
13 years 4 months ago
Software Designs of Image Processing Tasks With Incremental Refinement of Computation
Software realizations of computationally-demanding image processing tasks (e.g. image transforms and convolution) do not currently provide graceful degradation when their clock-cy...
Davide Anastasia, Yiannis Andreopoulos
CASES
2004
ACM
14 years 1 months ago
Translating affine nested-loop programs to process networks
New heterogeneous multiprocessor platforms are emerging that are typically composed of loosely coupled components that exchange data using programmable interconnections. The compon...
Alexandru Turjan, Bart Kienhuis, Ed F. Deprettere
AAAI
2006
13 years 11 months ago
Hard Constrained Semi-Markov Decision Processes
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong