Sciweavers

4110 search results - page 49 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
132
Voted
HEURISTICS
2006
197views more  HEURISTICS 2006»
15 years 3 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
120
Voted
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 4 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
158
Voted
CORR
2010
Springer
171views Education» more  CORR 2010»
15 years 3 months ago
Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...
123
Voted
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 7 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
102
Voted
CACM
2010
105views more  CACM 2010»
15 years 3 months ago
Censored exploration and the dark pool problem
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, J...