default search action
Marco A. F. Mollinetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Daniel Leal Souza, Rodrigo Lisbôa Pereira, Mario T. R. Serra Neto, Marco A. F. Mollinetti, Otávio Noura Teixeira, Roberto Célio Limão de Oliveira:
Dynamic Interconnection Approach With BLX-Based Search Applied to Multi-Swarm Optimizer: An Empirical Analysis to Real Constrained Optimization. IEEE Access 11: 12150-12175 (2023) - 2022
- [c16]Mario T. R. Serra Neto, Inês Dutra, Marco Antônio Florenzano Mollinetti:
Map-Optimize-Learn: Predicting Cardiac Pathology in Children and Teenagers with a Deep Learning Based Tabular Learning Method. IJCNN 2022: 1-8 - 2021
- [c15]Mario Tasso Ribeiro Serra Neto, Marco A. F. Mollinetti, Inês Dutra:
Data Domain Change and Feature Selection to Predict Cardiac Pathology with a 2D Clinical Dataset and Convolutional Neural Networks (Student Abstract). AAAI 2021: 15883-15884 - [c14]Marco Antônio Florenzano Mollinetti, Bernardo Bentes Gatto, Otávio Noura Teixeira:
An Augmented Lagrangian Artificial Bee Colony with Deterministic Variable Selection for Constrained Optimization. IBICA 2021: 239-250 - 2020
- [j2]Rodrigo Lisbôa Pereira, Daniel Leal Souza, Marco Antônio Florenzano Mollinetti, Mario Tasso Ribeiro Serra Neto, Edson Koiti Kudo Yasojima, Otávio Noura Teixeira, Roberto Célio Limão de Oliveira:
Game Theory and Social Interaction for Selection and Crossover Pressure Control in Genetic Algorithms: An Empirical Analysis to Real-Valued Constrained Optimization. IEEE Access 8: 144839-144865 (2020) - [j1]Marco Antônio Florenzano Mollinetti, Bernardo Bentes Gatto, Mario Tasso Ribeiro Serra Neto, Takahito Kuno:
A-DVM: A Self-Adaptive Variable Matrix Decision Variable Selection Scheme for Multimodal Problems. Entropy 22(9): 1004 (2020)
2010 – 2019
- 2019
- [c13]Bernardo B. Gatto, Marco A. F. Mollinetti, Eulanda Miranda dos Santos, Kazuhiro Fukui:
Tensor Fukunaga-Koontz Transform for Hierarchical Clustering. BRACIS 2019: 150-155 - [c12]Mario Tasso Ribeiro Serra Neto, Marco A. F. Mollinetti, Vladimiro Miranda, Leonel M. Carvalho:
Maximum Search Limitations: Boosting Evolutionary Particle Swarm Optimization Exploration. EPIA (1) 2019: 712-723 - 2018
- [c11]Rodrigo Lisbôa Pereira, Marco Antônio Florenzano Mollinetti, Mario Tasso Ribeiro Serra Neto, Adilson de Almeida Neto, Daniel Leal Souza, Edson Koiti Kudo Yasojima, Otávio Noura Teixeira, Roberto Célio Limão de Oliveira:
Parametric Analysis of Iterated Game Environments as Social Interaction Model for Genetic Algorithm to Solve Constrained Engineering Problems. CEC 2018: 1-8 - [c10]Marco Antônio Florenzano Mollinetti, Mario Tasso Ribeiro Serra Neto, Takahito Kuno:
Deterministic Parameter Selection of Artificial Bee Colony Based on Diagonalization. HIS 2018: 85-95 - [c9]Otávio Noura Teixeira, Mario Tasso Ribeiro Serra Neto, Demison Rolins de Souza Alves, Marco Antônio Florenzano Mollinetti, Fabio dos Santos Ferreira, Daniel Leal Souza, Rodrigo Lisbôa Pereira:
Evolutionary Quick Artificial Bee Colony for Constrained Engineering Design Problems. ICAISC (2) 2018: 603-615 - [c8]Mario Tasso Ribeiro Serra Neto, Marco Antônio Florenzano Mollinetti, Demison Rolins de Souza Alves, Rodrigo Lisbôa Pereira, Otávio Noura Teixeira:
CEMCO: A Novel Competitive Evolutionary Multi-Colony Optimization Algorithm for Constrained Problems. ICNC-FSKD 2018: 97-102 - 2017
- [c7]Mario Tasso Ribeiro Serra Neto, Marco Antônio Florenzano Mollinetti, Rodrigo Lisbôa Pereira:
Evolutionary artificial bee colony for neural networks training. ICNC-FSKD 2017: 44-49 - 2015
- [c6]Marco Antônio Florenzano Mollinetti, Daniel Leal Souza, Rodrigo Lisbôa Pereira, Edson Koiti Kudo Yasojima, Otávio Noura Teixeira:
ABC+ES: Combining Artificial Bee Colony Algorithm and Evolution Strategies on Engineering Design Problems and Benchmark Functions. HIS 2015: 53-66 - [c5]Edson Koiti Kudo Yasojima, Roberto Célio Limão de Oliveira, Otávio Noura Teixeira, Rodrigo Lisbôa Pereira, Marco A. F. Mollinetti:
Analyzing Genetic Algorithm with Game Theory and Adjusted Crossover Approach on Engineering Problems. HIS 2015: 177-188 - [c4]Rodrigo Lisbôa Pereira, Edson Koiti Kudo Yasojima, Rodrigo M. S. de Oliveira, Marco Antônio Florenzano Mollinetti, Otávio Noura Teixeira, Roberto Célio Limão de Oliveira:
Parallel genetic algorithm with social interaction for solving constrained global optimization problems. SoCPaR 2015: 351-356 - 2014
- [c3]Daniel Leal Souza, Otávio Noura Teixeira, Dionne Cavalcante Monteiro, Roberto Célio Limão de Oliveira, Marco Antônio Florenzano Mollinetti:
A Novel Competitive Quantum-Behaviour Evolutionary Multi-Swarm Optimizer Algorithm Based on CUDA Architecture Applied to Constrained Engineering Design. ANTS Conference 2014: 206-213 - [c2]Marco A. F. Mollinetti, Daniel Leal Souza, Otávio Noura Teixeira:
ABC+ES: a novel hybrid artificial bee colony algorithm with evolution strategies. GECCO (Companion) 2014: 1463-1464 - 2013
- [c1]Marco Antônio Florenzano Mollinetti, Jose Ney Magalhaes Almeida, Rodrigo Lisbôa Pereira, Otávio Noura Teixeira:
Performance analysis of the Imperialist Competitive algorithm using benchmark functions. SoCPaR 2013: 349-353
Coauthor Index
aka: Mario T. R. Serra Neto
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-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint