14 search results - page 1 / 3 » Fast Periodic Graph Exploration with Constant Memory |
116
click to vote
SIROCCO
2007
15 years 2 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
111
click to vote
TCS
2008
15 years 1 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
HPCA
2009
IEEE
16 years 1 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
107
click to vote
CODES
2008
IEEE
15 years 7 months ago
2008
IEEE
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
DCOSS
2005
Springer
15 years 6 months ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...