Sciweavers

1753 search results - page 133 / 351
» State Machines
Sort
View
EURODAC
1994
IEEE
110views VHDL» more  EURODAC 1994»
15 years 8 months ago
Symbolic exploration of large circuits with enhanced forward/backward traversals
Symbolic state space exploration techniques for Finite State Machines (FSMs) are a major recent result in CAD for VLSI. Most of them are exact and based on forward traversal, but ...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
CCS
2006
ACM
15 years 8 months ago
Cryptanalysis of the "Grain" family of stream ciphers
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
Alexander Maximov
ICTAI
1997
IEEE
15 years 8 months ago
Exploiting Symbolic Techniques within Genetic Algorithms for Power Optimization
This paper proposes an optimization algorithm for reducing the power dissipation in a sequential circuit. The encoding of the different states in a Finite State Machine is modifie...
S. Chuisano, Fulvio Corno, Paolo Prinetto, Maurizi...
ROOM
2000
15 years 5 months ago
On the Compositional Properties of UML Statechart Diagrams
This paper proposes a revised semantic interpretation of UML Statechart Diagrams which ensures, under the specified design rules, that Statecharts may be constructed to have true ...
Anthony J. H. Simons
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 4 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng