4131 search results - page 257 / 827 » The Generalized Max-Controlled Set Problem |
195
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
145
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
144
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
126
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
117
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...