19 search results - page 2 / 4 » Complete Strategies for Term Graph Narrowing |
PPDP
2001
Springer
13 years 10 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
ICIP
2010
IEEE
13 years 3 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
ENTCS
2008
13 years 5 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
—We present a navigation function through which a group of mobile agents can be coordinated to achieve a particular formation, both in terms of shape and orientation, while avoid...
IAT
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...