Sciweavers

3049 search results - page 90 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICALP
2000
Springer
15 years 8 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
NIPS
2008
15 years 5 months ago
Mind the Duality Gap: Logarithmic regret algorithms for online optimization
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
Shai Shalev-Shwartz, Sham M. Kakade
SIAMIS
2008
279views more  SIAMIS 2008»
15 years 4 months ago
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
Yilun Wang, Junfeng Yang, Wotao Yin, Yin Zhang
ISNN
2009
Springer
15 years 11 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
EC
2006
97views ECommerce» more  EC 2006»
15 years 4 months ago
A Step Forward in Studying the Compact Genetic Algorithm
The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent pop...
Reza Rastegar, Arash Hariri