Skip to content
/ Algorithms.LABS Public

Metaheuristics for finding good Low Autocorrelation Binary Sequences.

0 stars 1 fork Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

ppgllrd/Algorithms.LABS

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
libs/dcmt0.6.1
libs/dcmt0.6.1
 
 
EfficientFlip.c
EfficientFlip.c
 
 
GA.c
GA.c
 
 
GA.h
GA.h
 
 
GNUmakefile
GNUmakefile
 
 
LABS.c
LABS.c
 
 
LABS.h
LABS.h
 
 
LABSOpts.txt
LABSOpts.txt
 
 
README.md
README.md
 
 
TabuSearch.c
TabuSearch.c
 
 
TabuSearch.h
TabuSearch.h
 
 
dynamicMem.c
dynamicMem.c
 
 
dynamicMem.h
dynamicMem.h
 
 
random.c
random.c
 
 
random.h
random.h
 
 
timer.c
timer.c
 
 
timer.h
timer.h
 
 
types.h
types.h
 
 

Repository files navigation

LABS

Metaheuristics for finding good Low Autocorrelation Binary Sequences.

See: Finding low autocorrelation binary sequences with memetic algorithms José E.Gallardo, Carlos Cotta & Antonio J.Fernández Applied Soft Computing. Volume 9, Issue 4, September 2009, Pages 1252-1262

About

Metaheuristics for finding good Low Autocorrelation Binary Sequences.

Topics

labs autocorrelation memetic-algorithms metaheuristics combinatorial-optimization

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

 
 
 

Languages