1013 search results - page 5 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
105
click to vote
IPCO
2004
14 years 11 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
CEC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
ESCIENCE
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...