2031 search results - page 130 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
CEC
2008
IEEE
13 years 9 months ago
2008
IEEE
— A technique for the visualization of stochastic population–based algorithms in multidimensional problems with known global minimizers is proposed. The technique employs proje...
DAGSTUHL
2007
13 years 9 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
AAAI
2000
13 years 9 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
CPM
2008
Springer
13 years 10 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...