Toward hybrid platform for evolutionary computations of hard discrete problems

Żurek, Dominik; Piętak, Kamil; Pietroń, Marcin; Kisiel-Dorohinicki, Marek

doi:10.1016/j.procs.2017.05.201

Cited by 11 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The memetic agent-based paradigm [48], which combines evolutionary computation and local search techniques using parallel GPU implementation, is one of the promising meta-heuristics for solving a LABS problem.…”

Section: Introductionmentioning

confidence: 99%

Computational Search of Long Skew-symmetric Binary Sequences with High Merit Factors

Brest

Bošković

2022

mendel

View full text Add to dashboard Cite

In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult optimization problem. An improved version of the heuristic algorithm is presented and tackled to search for aperiodic binary sequences with good autocorrelation properties. High-performance computations with the execution of our stochastic algorithmto search skew-symmetric binary sequences with high merit factors. After experimental work, as results, we present new binary sequences with odd lengths between 201 and 303 that are skew-symmetric and have the merit factor F greater than 8.5. Moreover, an example of a binary sequence having F > 8 has been found for all odd lengths between 201 and 303. The longest binary sequence with F > 9 found to date is of length 255.

show abstract

Section: Introductionmentioning

confidence: 99%

Computational Search of Long Skew-symmetric Binary Sequences with High Merit Factors

Brest

Bošković

2022

mendel

View full text Add to dashboard Cite

show abstract

“…Memetic agent-based paradigm [36], which combines evolutionary computation and local search techniques using parallel GPU implementation, is one of the promising meta-heuristics for solving a LABS problem.…”

Section: Introductionmentioning

confidence: 99%

Computational Searching of Long Skew-symmetric Binary Sequences with High Merit Factors

Brest¹,

Bošković²

2020

Preprint

View full text Add to dashboard Cite

In this paper we present best-known merit factors of longer binary sequences with odd length. Finding low autocorrelation binary sequences with optimal merit factors is difficult optimization problem. High performance computations with execution of a stochastic algorithm in parallel, enable us searching skew-symmetric binary sequences with high merit factors. After experimental work, as results we present sequences with odd length between 301 and 401 that are skew-symmetric and have merit factor 𝐹 greater than 7. Moreover, now all sequences with odd length between 301 and 401 with 𝐹 > 7 have been found.

show abstract

New Variants of SDLS Algorithm for LABS Problem Dedicated to GPGPU Architectures

Żurek

Piętak

Pietroń

et al. 2021

Computational Science – ICCS 2021

View full text Add to dashboard Cite

Toward hybrid platform for evolutionary computations of hard discrete problems

Cited by 11 publications

References 7 publications

Computational Search of Long Skew-symmetric Binary Sequences with High Merit Factors

Computational Search of Long Skew-symmetric Binary Sequences with High Merit Factors

Computational Searching of Long Skew-symmetric Binary Sequences with High Merit Factors

New Variants of SDLS Algorithm for LABS Problem Dedicated to GPGPU Architectures

Contact Info

Product

Resources

About