Sciweavers

1550 search results - page 78 / 310
» Benchmarking for Graph Transformation
Sort
View
103
Voted
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
15 years 9 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
141
Voted
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
15 years 8 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
139
Voted
AGTIVE
2007
Springer
15 years 8 months ago
Applying a Grouping Operator in Model Transformations
The usability of model transformation languages depends on the abstractions one can work with in rules to perform complex operations on models. Recently, we have introduced a novel...
Daniel Balasubramanian, Anantha Narayanan, Sandeep...
146
Voted
ICSM
2002
IEEE
15 years 7 months ago
A Software Transformation Framework for Quality-Driven Object-Oriented Re-engineering
In re-engineering object-oriented legacy code, it is frequently useful to introduce a design pattern in order to improve specific non-functional requirements (e.g., maintainabili...
Ladan Tahvildari, Kostas Kontogiannis
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
15 years 6 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt