1115 search results - page 87 / 223 » Separating Shape Graphs |
129
Voted
FASE
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The OMG’s Model-Driven Architecture focusses on the evolution and integration of applications across heterogeneous middleware platforms. Presently available instances o...
121
click to vote
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
84
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
118
Voted
SYNASC
2008
IEEE
15 years 7 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
112
Voted
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...