3049 search results - page 383 / 610 » On the Convergence of Bound Optimization Algorithms |
114
click to vote
VLDB
1989
ACM
15 years 8 months ago
1989
ACM
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
123
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
141
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
165
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
145
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...