1550 search results - page 15 / 310 » Benchmarking for Graph Transformation |
102
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
105
click to vote
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
124
Voted
GG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
87
Voted
ISCAS
1999
IEEE
15 years 5 months ago
1999
IEEE
To provide a better understanding of physical design algorithms and the underlying circuit architecture they are targeting, we need to exercise the algorithms and architectures wi...
100
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...