1550 search results - page 65 / 310 » Benchmarking for Graph Transformation |
116
Voted
VL
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper presents a strategy for the visualization of dynamic object relationships in Java programs. The metaphor of a chemical molecule is used to aid comprehension, and to hel...
100
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...
127
click to vote
AIRWEB
2008
Springer
15 years 2 months ago
2008
Springer
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...
155
click to vote
AGTIVE
2007
Springer
15 years 4 months ago
2007
Springer
Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanc...
122
click to vote
JAIR
2007
15 years 22 days ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...