1026 search results - page 131 / 206 » An Optimal Solution to Room Search Problem |
153
click to vote
HM
2007
Springer
16 years 15 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
202
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
198
click to vote
SIAMIS
2010
15 years 1 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
172
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
170
click to vote
BIODATAMINING
2008
15 years 6 months ago
2008
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...