Sciweavers

1450 search results - page 185 / 290
» Fitness Uniform Optimization
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 4 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
124
Voted
NIPS
2008
15 years 2 months ago
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
John W. Roberts, Russ Tedrake
84
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 24 days ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
98
Voted
NETWORKS
2008
15 years 19 days ago
Grooming for two-period optical networks
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
95
Voted
PAMI
2008
147views more  PAMI 2008»
15 years 19 days ago
Image Stitching Using Structure Deformation
The aim of this paper is to achieve seamless image stitching without producing visual artifact caused by severe intensity discrepancy and structure misalignment, given that the inp...
Jiaya Jia, Chi-Keung Tang