396 search results - page 54 / 80 » Factor Automata of Automata and Applications |
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currentl...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
ISTCS
1992
Springer
13 years 11 months ago
1992
Springer
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
DM
2008
13 years 7 months ago
2008
Tolerance spaces and algebraic structures with compatible tolerances play an important role in contemporary algebra and their applications. In this contribution we are presenting ...
IJCAI
1997
13 years 9 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...