Sciweavers

206 search results - page 13 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
TASE
2008
IEEE
14 years 11 months ago
Perspectives in Probabilistic Verification
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
Joost-Pieter Katoen
ICUMT
2009
14 years 9 months ago
Large system analysis of beamforming for MIMO systems with limited training
We consider multiple-input multiple-output (MIMO) systems exploiting the full diversity order of a MIMO fading channel via optimal beamforming and combining. Specifically, an analy...
Francisco Rubio, Dongning Guo, Michael L. Honig, X...
ICML
2010
IEEE
15 years 23 days ago
Convergence of Least Squares Temporal Difference Methods Under General Conditions
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
Huizhen Yu
ISLPED
1997
ACM
104views Hardware» more  ISLPED 1997»
15 years 3 months ago
Composite sequence compaction for finite-state machines using block entropy and high-order Markov models
- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). B...
Radu Marculescu, Diana Marculescu, Massoud Pedram
GECCO
2007
Springer
217views Optimization» more  GECCO 2007»
15 years 1 months ago
A quantitative analysis of memory requirement and generalization performance for robotic tasks
In autonomous agent systems, memory is an important element to handle agent behaviors appropriately. We present the analysis of memory requirements for robotic tasks including wal...
DaeEun Kim