199 search results - page 11 / 40 » Higher-Order Critical Pairs |
IJRR
2002
13 years 7 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
IEEEARES
2006
IEEE
14 years 1 months ago
2006
IEEE
Since the 9/11 terrorist attacks, the effective and efficient protection of critical information infrastructures has become an even more important issue. To enhance network surviv...
ECEASST
2010
13 years 5 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
In order to investigate the deep structure of Gaussian scale space images, one needs to understand the behaviour of spatial critical points under the influence of blurring. We sho...
PARELEC
2002
IEEE
14 years 16 days ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...