Pretraga

Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 1211826

On the Difficulty of Evolving Permutation Codes

Mariot, Luca; Picek, Stjepan; Jakobović, Domagoj; Đurasević, Marko; Leporati, Alberto
On the Difficulty of Evolving Permutation Codes // Lecture Notes in Computer Science
Madrid, Španjolska: Springer, 2022. str. 141-156 doi:10.1007/978-3-031-02462-7_10 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)

CROSBI ID: 1211826 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
On the Difficulty of Evolving Permutation Codes

Autori
Mariot, Luca ; Picek, Stjepan ; Jakobović, Domagoj ; Đurasević, Marko ; Leporati, Alberto

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Lecture Notes in Computer Science / - : Springer, 2022, 141-156

ISBN
978-3-031-02461-0

Skup
International Conference on the Applications of Evolutionary Computation

Mjesto i datum
Madrid, Španjolska, 20.04.2022. - 22.04.2022

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Permutation codes ; Evolutionary algorithms ; Incremental construction ; Powerline communications ; Flash memories ; Block ciphers

Sažetak
Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline communications, flash memories, and block ciphers. This paper addresses the design of permutation codes by evolutionary algorithms (EA) by developing an iterative approach. Starting from a single random permutation, new permutations satisfying the minimum distance constraint are incrementally added to the code by using a permutation-based EA. We investigate our approach against four different fitness functions targeting the minimum distance requirement at different levels of detail and with two different policies concerning code expansion and pruning. We compare the results achieved by our EA approach to those of a simple random search, remarking that neither method scales well with the problem size.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Profili:

Avatar Url Marko Đurasević (autor)

Avatar Url Domagoj Jakobović (autor)

Avatar Url Stjepan Picek (autor)

Poveznice na cjeloviti tekst rada:

Pristup cjelovitom tekstu rada doi link.springer.com

Citiraj ovu publikaciju:

Mariot, Luca; Picek, Stjepan; Jakobović, Domagoj; Đurasević, Marko; Leporati, Alberto
On the Difficulty of Evolving Permutation Codes // Lecture Notes in Computer Science
Madrid, Španjolska: Springer, 2022. str. 141-156 doi:10.1007/978-3-031-02462-7_10 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Mariot, L., Picek, S., Jakobović, D., Đurasević, M. & Leporati, A. (2022) On the Difficulty of Evolving Permutation Codes. U: Lecture Notes in Computer Science doi:10.1007/978-3-031-02462-7_10.
@article{article, author = {Mariot, Luca and Picek, Stjepan and Jakobovi\'{c}, Domagoj and \DJurasevi\'{c}, Marko and Leporati, Alberto}, year = {2022}, pages = {141-156}, DOI = {10.1007/978-3-031-02462-7\_10}, keywords = {Permutation codes, Evolutionary algorithms, Incremental construction, Powerline communications, Flash memories, Block ciphers}, doi = {10.1007/978-3-031-02462-7\_10}, isbn = {978-3-031-02461-0}, title = {On the Difficulty of Evolving Permutation Codes}, keyword = {Permutation codes, Evolutionary algorithms, Incremental construction, Powerline communications, Flash memories, Block ciphers}, publisher = {Springer}, publisherplace = {Madrid, \v{S}panjolska} }
@article{article, author = {Mariot, Luca and Picek, Stjepan and Jakobovi\'{c}, Domagoj and \DJurasevi\'{c}, Marko and Leporati, Alberto}, year = {2022}, pages = {141-156}, DOI = {10.1007/978-3-031-02462-7\_10}, keywords = {Permutation codes, Evolutionary algorithms, Incremental construction, Powerline communications, Flash memories, Block ciphers}, doi = {10.1007/978-3-031-02462-7\_10}, isbn = {978-3-031-02461-0}, title = {On the Difficulty of Evolving Permutation Codes}, keyword = {Permutation codes, Evolutionary algorithms, Incremental construction, Powerline communications, Flash memories, Block ciphers}, publisher = {Springer}, publisherplace = {Madrid, \v{S}panjolska} }

Citati:

    Altmetrijski pokazatelji:


    Podijeli:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font
    CROSBI koristi kolačiće (cookies) kako bi poboljšao funkcionalnost stranice.