81 search results - page 16 / 17 » A Formalisation of Finite Automata Using Hereditarily Finite... |
ICDCS
2000
IEEE
13 years 9 months ago
2000
IEEE
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
WIA
2001
Springer
13 years 9 months ago
2001
Springer
A formal device is said to be adaptive whenever its behavior changes dynamically, in a direct response to its input stimuli, without interference of external agents, even its user...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
SIGMOD
2009
ACM
14 years 5 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...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...