1550 search results - page 107 / 310 » Benchmarking for Graph Transformation |
265
click to vote
CL
2012
Springer
13 years 5 months ago
2012
Springer
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
146
Voted
NPC
2010
Springer
15 years 1 months ago
2010
Springer
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
130
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Loop tiling is an important compiler transformation used for enhancing data locality and exploiting coarsegrained parallelism. Tiled codes in which tile sizes are runtime...
123
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
128
click to vote
IJCAI
2003
15 years 4 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...