45 search results - page 5 / 9 » Evolutionary State Assignment for Synchronous Finite State M... |
CEC
2003
IEEE
15 years 2 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
ISSTA
1998
ACM
15 years 1 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
114
click to vote
COLT
1992
Springer
15 years 1 months ago
1992
Springer
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...
IJCAI
1993
14 years 11 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...