198 search results - page 12 / 40 » Reachability on prefix-recognizable graphs |
HYBRID
2009
Springer
14 years 4 months ago
2009
Springer
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
AIPS
2000
13 years 11 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
CCR
2010
13 years 10 months ago
2010
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
AC
2003
Springer
14 years 3 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...