1357 search results - page 201 / 272 » Compositionality in Graph Transformation |
125
click to vote
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
125
Voted
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
161
click to vote
HIPEAC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...
148
click to vote
JMLR
2010
14 years 10 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
137
click to vote
MST
2010
14 years 10 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...