83 search results - page 1 / 17 » Solving Coverage Problems with Embedded Graph Grammars |
HYBRID
2007
Springer
15 years 1 months ago
2007
Springer
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
IWPT
2001
14 years 11 months ago
2001
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
110
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
ESOP
2009
Springer
15 years 1 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...