Sciweavers

936 search results - page 129 / 188
» FSM-Hume is finite state
Sort
View
ANSS
2001
IEEE
14 years 22 days ago
Fault Identification in Networks by Passive Testing
In this paper, we employ the finite state machine (FSM) model for networks to investigate fault identification using passive testing. First, we introduce the concept of passive te...
Raymond E. Miller, Khaled A. Arisha
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
14 years 19 days ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
ISLPED
1997
ACM
104views Hardware» more  ISLPED 1997»
14 years 18 days 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
EWRL
2008
13 years 10 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin
ALT
2010
Springer
13 years 10 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
Alexander Clark