1368 search results - page 29 / 274 » Avoiding Simplicity Is Complex |
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
AAAI
1996
13 years 11 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
ICIP
2002
IEEE
14 years 11 months ago
2002
IEEE
In this paper, we present a new deconvolution method, able to deal with noninvertible blurring functions. To avoid noise amplification, a prior model of the image to be reconstruc...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...