1550 search results - page 152 / 310 » Benchmarking for Graph Transformation |
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping b...
105
click to vote
EOR
2008
15 years 3 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
115
click to vote
COLING
2010
14 years 10 months ago
2010
Single-document summarization and multidocument summarization are very closely related tasks and they have been widely investigated independently. This paper examines the mutual i...
132
Voted
MCS
2010
Springer
15 years 5 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
133
click to vote
SIAMDM
2008
15 years 3 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...