554 search results - page 61 / 111 » Power Domination Problem in Graphs |
APN
2008
Springer
13 years 9 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
DAM
2008
13 years 7 months ago
2008
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
CAI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
ICRA
2000
IEEE
14 years 3 days ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
ICSE
1992
IEEE-ACM
13 years 11 months ago
1992
IEEE-ACM
This paper describes a language-independent program representation--the program dependence graph--and discusses how program dependence graphs, together with operations such as pro...