2126 search results - page 277 / 426 » An optimization algorithm for imprecise multi-objective prob... |
166
click to vote
SIGECOM
2005
ACM
15 years 12 months ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
167
click to vote
TALG
2010
15 years 4 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
193
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
148
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
209
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...