Sciweavers

1916 search results - page 174 / 384
» Reconfiguring a state machine
Sort
View
EURODAC
1994
IEEE
110views VHDL» more  EURODAC 1994»
14 years 8 days 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
13 years 12 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
SPIRE
2000
Springer
13 years 11 months ago
Fast Multipattern Search Algorithms for Intrusion Detection
We present new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text charact...
Josué Kuri, Gonzalo Navarro
ICTAI
1997
IEEE
13 years 11 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...
CLA
2007
13 years 9 months ago
Policies Generalization in Reinforcement Learning using Galois Partitions Lattices
The generalization of policies in reinforcement learning is a main issue, both from the theoretical model point of view and for their applicability. However, generalizing from a se...
Marc Ricordeau, Michel Liquiere