3757 search results - page 569 / 752 » The overlap number of a graph |
160
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
174
click to vote
GBRPR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
167
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
153
click to vote
ICSM
2002
IEEE
15 years 11 months ago
2002
IEEE
Class cohesion could be used to evaluate the design quality of classes, to develop test measures for objectoriented software and to restructure poorly designed classes. Among a nu...
184
click to vote
GECCO
2010
Springer
15 years 11 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 ...