Sciweavers

694 search results - page 20 / 139
» Open Graphs and Computational Reasoning
Sort
View
AGTIVE
2007
Springer
14 years 1 months ago
Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation
Abstract. Applying refactoring in a model-driven software engineering context raises many new challenges that need to be addressed. In this paper, we consider model-driven software...
Gabriele Taentzer, Dirk Müller 0002, Tom Mens
ICS
1993
Tsinghua U.
14 years 1 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
BIRTHDAY
2005
Springer
14 years 2 months ago
Graph Transformation with Variables
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
Berthold Hoffmann
PPOPP
2009
ACM
14 years 9 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
GC
2010
Springer
13 years 7 months ago
20 Years of Negami's Planar Cover Conjecture
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Petr Hlinený