izpis_h1_title_alt

Imperative genetic programming
ID Fajfar, Iztok (Avtor), ID Rojec, Žiga (Avtor), ID Bürmen, Arpad (Avtor), ID Kunaver, Matevž (Avtor), ID Tuma, Tadej (Avtor), ID Tomažič, Sašo (Avtor), ID Puhan, Janez (Avtor)

.pdfPDF - Predstavitvena datoteka, prenos (716,86 KB)
MD5: D70844C88121FCB8B51032DDBCF79D81
URLURL - Izvorni URL, za dostop obiščite https://www.mdpi.com/2073-8994/16/9/1146 Povezava se odpre v novem oknu

Izvleček
Genetic programming (GP) has a long-standing tradition in the evolution of computer programs, predominantly utilizing tree and linear paradigms, each with distinct advantages and limitations. Despite the rapid growth of the GP field, there have been disproportionately few attempts to evolve ’real’ Turing-like imperative programs (as contrasted with functional programming) from the ground up. Existing research focuses mainly on specific special cases where the structure of the solution is partly known. This paper explores the potential of integrating tree and linear GP paradigms to develop an encoding scheme that universally supports genetic operators without constraints and consistently generates syntactically correct Python programs from scratch. By blending the symmetrical structure of tree-based representations with the inherent asymmetry of linear sequences, we created a versatile environment for program evolution. Our approach was rigorously tested on 35 problems characterized by varying Halstead complexity metrics, to delineate the approach’s boundaries. While expected brute-force program solutions were observed, our method yielded more sophisticated strategies, such as optimizing a program by restricting the division trials to the values up to the square root of the number when counting its proper divisors. Despite the recent groundbreaking advancements in large language models, we assert that the GP field warrants continued research. GP embodies a fundamentally different computational paradigm, crucial for advancing our understanding of natural evolutionary processes.

Jezik:Angleški jezik
Ključne besede:evolutionary agorithms, tree genetic programming, linear genetic programming, imperative programming
Vrsta gradiva:Članek v reviji
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:FE - Fakulteta za elektrotehniko
Status publikacije:Objavljeno
Različica publikacije:Objavljena publikacija
Leto izida:2024
Št. strani:19 str.
Številčenje:Vol. 16, iss. 9, art. 1146
PID:20.500.12556/RUL-161550 Povezava se odpre v novem oknu
UDK:004.42
ISSN pri članku:2073-8994
DOI:10.3390/sym16091146 Povezava se odpre v novem oknu
COBISS.SI-ID:207066371 Povezava se odpre v novem oknu
Datum objave v RUL:12.09.2024
Število ogledov:69
Število prenosov:9
Metapodatki:XML RDF-CHPDL DC-XML DC-RDF
:
Kopiraj citat
Objavi na:Bookmark and Share

Gradivo je del revije

Naslov:Symmetry
Skrajšan naslov:Symmetry
Založnik:Molecular Diversity Preservation International
ISSN:2073-8994
COBISS.SI-ID:517592345 Povezava se odpre v novem oknu

Licence

Licenca:CC BY 4.0, Creative Commons Priznanje avtorstva 4.0 Mednarodna
Povezava:http://creativecommons.org/licenses/by/4.0/deed.sl
Opis:To je standardna licenca Creative Commons, ki daje uporabnikom največ možnosti za nadaljnjo uporabo dela, pri čemer morajo navesti avtorja.

Sekundarni jezik

Jezik:Slovenski jezik
Ključne besede:evolucijski algoritmi, drevesno genetsko programiranje, linearno genetsko programiranje, imperativno programiranje

Projekti

Financer:ARIS - Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Številka projekta:P2-0246
Naslov:ICT4QoL - Informacijsko komunikacijske tehnologije za kakovostno življenje

Podobna dela

Podobna dela v RUL:
Podobna dela v drugih slovenskih zbirkah:

Nazaj