1550 search results - page 68 / 310 » Benchmarking for Graph Transformation |
105
Voted
IDA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approa...
KSEM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate l...
146
click to vote
GG
2008
Springer
15 years 1 months ago
2008
Springer
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
93
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
83
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...