7519 search results - page 377 / 1504 » Optimizing Generic Functions |
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
213
click to vote
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
14 years 10 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
169
click to vote
LPAR
2005
Springer
16 years 7 days ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
153
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
In optimization problems involving large amounts of data, such as web content, commercial transaction information, or bioinformatics data, individual function evaluations may take ...
182
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...