Towards a General Boolean Function Benchmark Suite

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F23%3APU149636" target="_blank" >RIV/00216305:26230/23:PU149636 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/3583133.3590685" target="_blank" >http://dx.doi.org/10.1145/3583133.3590685</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3583133.3590685" target="_blank" >10.1145/3583133.3590685</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Towards a General Boolean Function Benchmark Suite

Popis výsledku v původním jazyce

Just over a decade ago, the first comprehensive review on the state of benchmarking in Genetic Programming (GP) analyzed the mismatch between the problems that are used to test the performance of GP systems and real-world problems. Since then, several benchmark suites in major GP problem domains have been proposed over time, which were able to fill some of the major gaps. In the framework of the first review about the state of benchmarking in GP, logic synthesis was classified as one of the major GP problem domains. However, a diverse and accessible benchmark suite for logic synthesis is still missing in the field of GP. In this work, we take a first step towards a benchmark suite for logic synthesis that covers different types of Boolean functions that are commonly used for the evaluation of GP systems. We also present baseline results that have been obtained by former work and in our evaluation experiments by using Cartesian Genetic Programming.

Název v anglickém jazyce

Towards a General Boolean Function Benchmark Suite

Popis výsledku anglicky

Just over a decade ago, the first comprehensive review on the state of benchmarking in Genetic Programming (GP) analyzed the mismatch between the problems that are used to test the performance of GP systems and real-world problems. Since then, several benchmark suites in major GP problem domains have been proposed over time, which were able to fill some of the major gaps. In the framework of the first review about the state of benchmarking in GP, logic synthesis was classified as one of the major GP problem domains. However, a diverse and accessible benchmark suite for logic synthesis is still missing in the field of GP. In this work, we take a first step towards a benchmark suite for logic synthesis that covers different types of Boolean functions that are commonly used for the evaluation of GP systems. We also present baseline results that have been obtained by former work and in our evaluation experiments by using Cartesian Genetic Programming.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA22-02067S" target="_blank" >GA22-02067S: AppNeCo: Aproximativní neurovýpočty</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

GECCO 2023 Companion - Proceedings of the 2023 Genetic and Evolutionary Computation Conference Companion

ISBN

979-8-4007-0120-7

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

591-594

Název nakladatele

Association for Computing Machinery

Místo vydání

New York

Místo konání akce

Lisbon

Datum konání akce

15. 7. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—