534 search results - page 61 / 107 » Efficient polynomial L-approximations |
EOR
2006
13 years 7 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
SIAMCOMP
2008
13 years 7 months ago
2008
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
EC
2008
13 years 7 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
SMA
2008
ACM
13 years 7 months ago
2008
ACM
We convert any quad manifold mesh into an at least C1 surface consisting of bi-cubic tensor-product splines with localized perturbations of degree bi-5 near non-4-valent vertices....
COLT
2010
Springer
13 years 5 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...