1951 search results - page 49 / 391 » An algorithm for improving graph partitions |
COCOON
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We propose the use of programmable Grid resource partitioning heuristics in the context of a distributed service Grid management architecture. The architecture is capable...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Due to the nature of an acoustic enclosure, the early part (i.e., direct path and early reflections) of the acoustic echo path is often sparse while the late reverberant part of ...
105
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...