Sciweavers

40 search results - page 4 / 8
» Construction of Lyapunov functions for piecewise-determinist...
Sort
View
NIPS
2000
13 years 9 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
ICTAI
1996
IEEE
13 years 11 months ago
Incremental Markov-Model Planning
This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. T...
Richard Washington
MA
2011
Springer
188views Communications» more  MA 2011»
13 years 2 months ago
A copula-based model of speculative price dynamics in discrete time
This paper suggests a new technique to construct first order Markov processes using products of copula functions, in the spirit of Darsow et al. (1992). The approach requires the...
Umberto Cherubini, Sabrina Mulinacci, Silvia Romag...
QUESTA
2000
68views more  QUESTA 2000»
13 years 7 months ago
Ergodicity of the BMAP/PH}/s/s+K retrial queue with PH-retrial times
Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and onl...
Qi-Ming He, Hui Li, Yiqiang Q. Zhao
AAAI
2012
11 years 10 months ago
A Dynamic Rationalization of Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a ration...
Craig Boutilier, Ariel D. Procaccia