Sciweavers

77 search results - page 4 / 16
» Finite State Machine Decomposition For Low Power
Sort
View
TCS
2010
13 years 5 months ago
Canonical finite state machines for distributed systems
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
Robert M. Hierons
EH
1999
IEEE
351views Hardware» more  EH 1999»
13 years 11 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
ICVGIP
2004
13 years 8 months ago
A Framework for Activity Recognition and Detection of Unusual Activities
In this paper we present a simple framework for activity recognition based on a model of multi-layered finite state machines, built on top of a low level image processing module f...
Dhruv Mahajan, Nipun Kwatra, Sumit Jain, Prem Kalr...
COLT
1992
Springer
13 years 11 months ago
On the Computational Power of Neural Nets
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
Hava T. Siegelmann, Eduardo D. Sontag
ISLPED
1998
ACM
94views Hardware» more  ISLPED 1998»
13 years 11 months ago
Theoretical bounds for switching activity analysis in finite-state machines
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
Diana Marculescu, Radu Marculescu, Massoud Pedram