1916 search results - page 174 / 384 » Reconfiguring a state machine |
115
Voted
EURODAC
1994
IEEE
15 years 6 months ago
1994
IEEE
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 ...
130
Voted
CCS
2006
ACM
15 years 6 months ago
2006
ACM
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...
105
click to vote
SPIRE
2000
Springer
15 years 6 months ago
2000
Springer
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...
145
Voted
ICTAI
1997
IEEE
15 years 6 months ago
1997
IEEE
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...
128
Voted
CLA
2007
15 years 4 months ago
2007
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...