3475 search results - page 119 / 695 » Backbones in Optimization and Approximation |
141
click to vote
ICMCS
2006
IEEE
16 years 11 days ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
158
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
192
click to vote
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
143
click to vote
SIAMCO
2000
15 years 6 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
138
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
The role of space is more and more accepted as a way to dramatically improve the success of coevolutionary function approximation. The process behind this success however is not y...