default search action
Sílvia M. D. M. Maia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Murilo Oliveira Machado, Islame F. C. Fernandes, Sílvia Maria Diniz Monteiro Maia, Elizabeth Ferreira Gouvea Goldbarg:
A hybrid multi-agent metaheuristic for the offshore wind farm cable routing problem. Expert Syst. Appl. 255: 124668 (2024) - 2023
- [j6]Hiago Mayk G. de A. Rocha, Antonio Carlos Schneider Beck, Márcio Eduardo Kreutz, Sílvia Maria Diniz Monteiro Maia, Monica Magalhães Pereira:
Using evolutionary metaheuristics to solve the mapping and routing problem in networks on chip. Des. Autom. Embed. Syst. 27(1-2): 51-83 (2023) - 2022
- [j5]Breno M. F. Viana, Leonardo T. Pereira, Claudio Fabiano Motta Toledo, Selan R. dos Santos, Sílvia M. D. M. Maia:
Feasible-Infeasible Two-Population Genetic Algorithm to evolve dungeon levels with dependencies in barrier mechanics. Appl. Soft Comput. 119: 108586 (2022) - 2021
- [j4]Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg:
Multi- and many-objective path-relinking: A taxonomy and decomposition approach. Comput. Oper. Res. 133: 105370 (2021) - 2020
- [j3]Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg:
Empirical study of exact algorithms for the multi-objective spanning tree. Comput. Optim. Appl. 75(2): 561-605 (2020) - [j2]Islame F. C. Fernandes, Igor Rosberg de Medeiros Silva, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg:
A PSO-inspired architecture to hybridise multi-objective metaheuristics. Memetic Comput. 12(3): 235-249 (2020) - [c5]Hiago Mayk G. de A. Rocha, Antonio Carlos Schneider Beck, Sílvia M. D. M. Maia, Márcio Eduardo Kreutz, Monica Magalhães Pereira:
A Routing based Genetic Algorithm for Task Mapping on MPSoC. SBESC 2020: 1-8
2010 – 2019
- 2019
- [c4]Thiago Soares Marques, Sidemar Fideles Cezario, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg, Sílvia Maria Diniz Monteiro Maia:
Quota Traveling Salesman with Passengers and Collection Time. BRACIS 2019: 299-304 - [c3]Luis Tertulino, Sílvia Maria Diniz Monteiro Maia, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
TSchainRad: a new Tabu Search-Based Matheuristic for IMRT Optimization. BRACIS 2019: 305-310 - [c2]Islame F. C. Fernandes, Sílvia M. D. M. Maia, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
A Multi-agent Transgenetic Algorithm for the Bi-objective Spanning Tree Problem. LAGOS 2019: 449-460 - 2016
- [c1]Sílvia M. D. M. Maia, Elizabeth Ferreira Gouvea Goldbarg, Lucas D. M. dos S. Pinheiro, Marco César Goldbarg:
Tabu Search with Ejection Chain for the Biobjective Adjacent-Only Quadratic Spanning Tree. BRACIS 2016: 313-318 - 2013
- [j1]Sílvia M. D. M. Maia, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
On the Biobjective Adjacent Only Quadratic Spanning Tree Problem. Electron. Notes Discret. Math. 41: 535-542 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint