1550 search results - page 225 / 310 » Benchmarking for Graph Transformation |
FOAL
2009
ACM
14 years 1 months ago
2009
ACM
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
FASE
2010
Springer
14 years 1 months ago
2010
Springer
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
UAI
2001
13 years 11 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...