Sciweavers

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

11

CP
2008
Springer

favoriteEmaildiscussreport

106views Artificial Intelligence» more CP 2008»

Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem

13 years 6 months ago

Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem

Download www.comp.nus.edu.sg

Abstract. This paper engineers a new state-of-the-art Stochastic Local Search (SLS) for the Low Autocorrelation Binary Sequence (LABS) problem. The new SLS solver is obtained with white-box visualization to get insights on how an SLS can be effective for LABS; implementation improvements; and black-box parameter tuning.

Steven Halim, Roland H. C. Yap, Felix Halim

Real-time Traffic

Artificial Intelligence | Autocorrelation Binary Sequence | CP 2008 | Stochastic Local Search | White-box Visualization |

claim paper

Related Content

» A memetic algorithm for the low autocorrelation binary sequence problem

» Parallel Genetic Algorithms with Schema Migration

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	CP
Authors	Steven Halim, Roland H. C. Yap, Felix Halim

Comments (0)