426 search results - page 64 / 86 » Synchronization of Regular Automata |
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— This paper examines the performance characteristics of both asynchronous and synchronous parallel particle swarm optimisation algorithms in heterogeneous, fault-prone e...
APN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamicall...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
ITICSE
2004
ACM
14 years 1 months ago
2004
ACM
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...