Specializing Context-Free Grammars with a (1 + 1)-EA

Detalhes bibliográficos
Autor(a) principal: Manzoni, Luca
Data de Publicação: 2020
Outros Autores: Bartoli, Alberto, Castelli, Mauro, Goncalves, Ivo, Medvet, Eric
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10362/106241
Resumo: Manzoni, L., Bartoli, A., Castelli, M., Goncalves, I., & Medvet, E. (2020). Specializing Context-Free Grammars with a (1 + 1)-EA. IEEE Transactions on Evolutionary Computation, 24(5), 960-973. [9047973]. https://doi.org/10.1109/TEVC.2020.2983664
id RCAP_272fd117763de454641534e8944f285c
oai_identifier_str oai:run.unl.pt:10362/106241
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Specializing Context-Free Grammars with a (1 + 1)-EAGrammar designgrammatical evolutionrun time analysisSoftwareTheoretical Computer ScienceComputational Theory and MathematicsManzoni, L., Bartoli, A., Castelli, M., Goncalves, I., & Medvet, E. (2020). Specializing Context-Free Grammars with a (1 + 1)-EA. IEEE Transactions on Evolutionary Computation, 24(5), 960-973. [9047973]. https://doi.org/10.1109/TEVC.2020.2983664Context-free grammars are useful tools for modeling the solution space of problems that can be solved by optimization algorithms. For a given solution space, there exists an infinite number of grammars defining that space, and there are clues that changing the grammar may impact the effectiveness of the optimization. In this article, we investigate theoretically and experimentally the possibility of specializing a grammar in a problem, that is, of systematically improving the quality of the grammar for the given problem. To this end, we define the quality of a grammar for a problem in terms of the average fitness of the candidate solutions generated using that grammar. Theoretically, we demonstrate the following findings: 1) that a simple mutation operator employed in a (1 + 1)-EA setting can be used to specialize a grammar in a problem without changing the solution space defined by the grammar and 2) that three grammars of equal quality for a grammar-based version of the ONEMAX problem greatly vary in how they can be specialized with that (1 + 1)-EA, as the expected time required to obtain the same improvement in quality can vary exponentially among grammars. Then, experimentally, we validate the theoretical findings and extend them to other problems, grammars, and a more general version of the mutation operator.NOVA Information Management School (NOVA IMS)Information Management Research Center (MagIC) - NOVA Information Management SchoolRUNManzoni, LucaBartoli, AlbertoCastelli, MauroGoncalves, IvoMedvet, Eric2023-03-11T01:31:50Z2020-102020-10-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article14application/pdfhttp://hdl.handle.net/10362/106241eng1089-778XPURE: 26084547https://doi.org/10.1109/TEVC.2020.2983664info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-05-22T17:48:22Zoai:run.unl.pt:10362/106241Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-05-22T17:48:22Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Specializing Context-Free Grammars with a (1 + 1)-EA
title Specializing Context-Free Grammars with a (1 + 1)-EA
spellingShingle Specializing Context-Free Grammars with a (1 + 1)-EA
Manzoni, Luca
Grammar design
grammatical evolution
run time analysis
Software
Theoretical Computer Science
Computational Theory and Mathematics
title_short Specializing Context-Free Grammars with a (1 + 1)-EA
title_full Specializing Context-Free Grammars with a (1 + 1)-EA
title_fullStr Specializing Context-Free Grammars with a (1 + 1)-EA
title_full_unstemmed Specializing Context-Free Grammars with a (1 + 1)-EA
title_sort Specializing Context-Free Grammars with a (1 + 1)-EA
author Manzoni, Luca
author_facet Manzoni, Luca
Bartoli, Alberto
Castelli, Mauro
Goncalves, Ivo
Medvet, Eric
author_role author
author2 Bartoli, Alberto
Castelli, Mauro
Goncalves, Ivo
Medvet, Eric
author2_role author
author
author
author
dc.contributor.none.fl_str_mv NOVA Information Management School (NOVA IMS)
Information Management Research Center (MagIC) - NOVA Information Management School
RUN
dc.contributor.author.fl_str_mv Manzoni, Luca
Bartoli, Alberto
Castelli, Mauro
Goncalves, Ivo
Medvet, Eric
dc.subject.por.fl_str_mv Grammar design
grammatical evolution
run time analysis
Software
Theoretical Computer Science
Computational Theory and Mathematics
topic Grammar design
grammatical evolution
run time analysis
Software
Theoretical Computer Science
Computational Theory and Mathematics
description Manzoni, L., Bartoli, A., Castelli, M., Goncalves, I., & Medvet, E. (2020). Specializing Context-Free Grammars with a (1 + 1)-EA. IEEE Transactions on Evolutionary Computation, 24(5), 960-973. [9047973]. https://doi.org/10.1109/TEVC.2020.2983664
publishDate 2020
dc.date.none.fl_str_mv 2020-10
2020-10-01T00:00:00Z
2023-03-11T01:31:50Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10362/106241
url http://hdl.handle.net/10362/106241
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1089-778X
PURE: 26084547
https://doi.org/10.1109/TEVC.2020.2983664
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 14
application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv mluisa.alvim@gmail.com
_version_ 1817545764282302464

Registros relacionados