Sciweavers

7311 search results - page 119 / 1463
» Time in State Machines
Sort
View
ICML
1994
IEEE
15 years 7 months ago
Learning Without State-Estimation in Partially Observable Markovian Decision Processes
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
CAV
1998
Springer
98views Hardware» more  CAV 1998»
15 years 8 months ago
Verification of Timed Systems Using POSETs
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
Wendy Belluomini, Chris J. Myers
ICML
2008
IEEE
16 years 5 months ago
An HDP-HMM for systems with state persistence
The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstra...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
121
Voted
ECML
2006
Springer
15 years 7 months ago
PAC-Learning of Markov Models with Hidden State
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
Ricard Gavaldà, Philipp W. Keller, Joelle P...
CSCLP
2006
Springer
15 years 7 months ago
A Constraint Model for State Transitions in Disjunctive Resources
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
Roman Barták, Ondrej Cepek