default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdemir Aparecido Constantino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Diego de S. Lima
, Luiz J. A. Amichi, Maria A. Fernandez, Ademir Aparecido Constantino, Flávio A. V. Seixas:
NCYPred: A Bidirectional LSTM Network With Attention for Y RNA and Short Non-Coding RNA Classification. IEEE ACM Trans. Comput. Biol. Bioinform. 20(1): 557-565 (2023)- 2020
- [j7]Murilo Falleiros Lemos Schmitt, Mauro Henrique Mulati, Ademir Aparecido Constantino, Fábio Hernandes, Tony Alexander Hild:
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem. J. Univers. Comput. Sci. 26(2): 293-316 (2020) - [c14]Guilherme H. S. Nakahata, Ademir Aparecido Constantino, Yandre M. G. Costa:
Bonsai Style Classification: a new database and baseline results. ISM 2020: 104-110
2010 – 2019
- 2018
- [j6]Murilo Zangari, Ademir Aparecido Constantino, Josu Ceberio:
A decomposition-based kernel of Mallows models algorithm for bi- and tri-objective permutation flowshop scheduling problem. Appl. Soft Comput. 71: 526-537 (2018) - [c13]Murilo Zangari, Ademir Aparecido Constantino, Josu Ceberio:
A Decomposition-Based Local Search Algorithm for Multi-Objective Sequence Dependent Setup Times Permutation Flowshop Scheduling. CEC 2018: 1-8 - [c12]Rodrigo Lankaites Pinheiro, Dario Landa-Silva, Wasakorn Laesanklang, Ademir Aparecido Constantino:
Using Goal Programming on Estimated Pareto Fronts to Solve Multiobjective Problems. ICORES 2018: 132-143 - [c11]Rodrigo Lankaites Pinheiro, Dario Landa-Silva, Wasakorn Laesanklang, Ademir Aparecido Constantino:
An Efficient Application of Goal Programming to Tackle Multiobjective Problems with Recurring Fitness Landscapes. ICORES (Selected Papers) 2018: 134-152 - 2017
- [j5]Landir Saviniec, Ademir Aparecido Constantino:
Effective local search algorithms for high school timetabling problems. Appl. Soft Comput. 60: 363-373 (2017) - [j4]Ademir Aparecido Constantino, Candido Ferreira Xavier de Mendonça Neto, Silvio Alexandre de Araujo, Dario Landa-Silva, Rogério Calvi, Allainclair Flausino dos Santos:
Solving a Large Real-world Bus Driver Scheduling Problem with a Multi-assignment based Heuristic Algorithm. J. Univers. Comput. Sci. 23(5): 479-504 (2017) - 2016
- [c10]Rodrigo Lankaites Pinheiro, Dario Landa-Silva, Rong Qu, Edson Yanaga, Ademir Aparecido Constantino:
Towards an Efficient API for Optimisation Problems Data. ICEIS (2) 2016: 89-98 - [c9]Rodrigo Calvo, Ademir Aparecido Constantino, Maurício F. Figueiredo:
Individual distinguishing pheromone in a multi-robot system for a Balanced Partitioned Surveillance task. IJCNN 2016: 4346-4353 - 2015
- [c8]Ademir Aparecido Constantino, Everton Tozzo, Rodrigo Lankaites Pinheiro, Dario Landa-Silva, Wesley Romão:
A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction. ICEIS (1) 2015: 462-470 - [c7]Ademir Aparecido Constantino, Candido Ferreira Xavier de Mendonça Neto, Antonio Galvão Novaes, Allainclair Flausino dos Santos:
Combining Heuristic and Utility Function for Fair Train Crew Rostering. ICEIS (1) 2015: 593-602 - [c6]Rodrigo Calvo, Ademir Aparecido Constantino, Maurício F. Figueiredo:
A multi-pheromone stigmergic distributed robot coordination strategy for fast surveillance task execution in unknown environments. IJCNN 2015: 1-8 - 2014
- [j3]Ademir Aparecido Constantino, Dario Landa-Silva, Everton Luiz de Melo, Candido Ferreira Xavier de Mendonça Neto, Douglas Baroni Rizzato, Wesley Romão:
A heuristic algorithm based on multi-assignment procedures for nurse scheduling. Ann. Oper. Res. 218(1): 165-183 (2014) - [c5]Rodrigo Lankaites Pinheiro, Ademir Aparecido Constantino, Candido F. X. de Mendonça, Dario Landa-Silva:
An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion. ICEIS (1) 2014: 464-471 - [c4]Andre Noel, José Magon Jr., Ademir Aparecido Constantino:
Evolutionary Algorithms Applied to Agribusiness Scheduling Problem. ICEIS (1) 2014: 489-496 - 2012
- [c3]Murilo Zangari, Wesley Romão, Ademir Aparecido Constantino:
Extensions of Ant-Miner Algorithm to Deal with Class Imbalance Problem. IDEAL 2012: 9-18 - 2011
- [j2]Silvio A. de Araujo, Ademir Aparecido Constantino, Kelly Cristina Poldi:
An evolutionary algorithm for the one-dimensional cutting stock problem. Int. Trans. Oper. Res. 18(1): 115-127 (2011) - [c2]Ademir Aparecido Constantino, Dario Landa-Silva, Everton L. de Melo, Wesley Romão:
A heuristic algorithm for nurse scheduling with balanced preference satisfaction. CISched 2011: 39-45 - [c1]Mauro Henrique Mulati, Ademir Aparecido Constantino:
Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem. SCCC 2011: 265-274
2000 – 2009
- 2009
- [j1]Candido Ferreira Xavier de Mendonça Neto, Ademir Aparecido Constantino, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo:
Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Comb. 92 (2009)
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-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
