2681 search results - page 48 / 537 » Problem F |
GECCO
2011
Springer
13 years 11 days ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
JUCS
2008
13 years 8 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
CP
2006
Springer
14 years 19 days ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...