3049 search results - page 413 / 610 » On the Convergence of Bound Optimization Algorithms |
114
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
154
click to vote
SIAMSC
2008
15 years 4 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
175
click to vote
ISPD
2012
ACM
14 years 3 days ago
2012
ACM
Importance sampling is a popular approach to estimate rare event failures of SRAM cells. We propose to improve importance sampling by probability collectives. First, we use “Kul...
141
click to vote
JACM
2000
15 years 4 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
129
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...