570 search results - page 23 / 114 » Robustness and Implementability of Timed Automata |
115
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
102
click to vote
ASE
2002
14 years 11 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
RAS
2008
14 years 11 months ago
2008
This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collisionfree trajectories in real-time. The algo...
117
click to vote
ICDCS
2000
IEEE
15 years 3 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...
VTC
2008
IEEE
15 years 6 months ago
2008
IEEE
—Single-carrier (SC) transmission using frequency domain equalization (FDE) is one of the candidates for the next generation mobile communication systems expected to deliver high...