4865 search results - page 555 / 973 » The Complexity of Graph Connectivity |
194
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 ...
185
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
174
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
154
click to vote
SIBGRAPI
2000
IEEE
15 years 11 months ago
2000
IEEE
This article deals with a new segmentation approach applied to unconstrained handwritten digits. The novelty of the proposed algorithm is based on the combination of two types of s...
209
click to vote
CA
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper shows a new approach to model and control interactive objects for simulations with virtual human agents when real time interactivity is essential. A general conceptuali...