7006 search results - page 455 / 1402 » Approximation Algorithms |
182
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
200
click to vote
INFOCOM
2005
IEEE
16 years 13 days ago
2005
IEEE
— We study the issue of handling unknown inter-cell interference in multi-cell environments with antenna arrays at the base stations. First, we demonstrate that the presence of u...
183
click to vote
SIGECOM
2000
ACM
15 years 11 months ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
184
Voted
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
209
Voted
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...