Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

GECCO
2004
Springer

favoriteEmaildiscussreport

97views Optimization» more GECCO 2004»

Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions

13 years 10 months ago

Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions

Download www.cs.cmu.edu

Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied extensively in the evolutionary computation literature. The algorithm presented uses efficient linkage discovery in conjunction with local search. Using our algorithm, the global optimum of an order-k additively separable function defined on strings of length can be found using O( ln( )2k ) function evaluations, a bound which is lower than all those that have previously been reported.

Matthew J. Streeter

Real-time Traffic

Algorithm Presented Uses | GECCO 2004 | Global Optimum | Separable Function |

claim paper

Related Content

» Compact Convex Upper Bound Iteration for Approximate POMDP Planning

» MinimaxOptimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming

» TimeBounded Kolmogorov Complexity and Solovay Functions

» Distributed DoubleDifferential Orthogonal SpaceTime Coding for Cooperative Networks

» Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Map...

» On the analysis of average time complexity of estimation of distribution algorithms

» Active Learning by Spherical Subdivision

» The BlackBox Complexity of Nearest Neighbor Search

» Cubature formulas for function spaces with moderate smoothness

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	GECCO
Authors	Matthew J. Streeter

Comments (0)