1550 search results - page 99 / 310 » Benchmarking for Graph Transformation |
143
click to vote
ICSE
2001
IEEE-ACM
15 years 7 months ago
2001
IEEE-ACM
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
145
Voted
WOSP
2005
ACM
15 years 9 months ago
2005
ACM
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
117
click to vote
ENTCS
2008
15 years 3 months ago
2008
In the framework of graph transformation, simulation rules define the operational behavior of visual models. Moreover, it has been shown already how to construct animation rules f...
121
click to vote
CVIU
2004
15 years 3 months ago
2004
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
123
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...