default search action
Anabela Moreira Bernardino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c22]Kevin Baptista, Anabela Moreira Bernardino, Eugénia Moreira Bernardino:
Detecting SQL Injection Vulnerabilities Using Nature-inspired Algorithms. ICCS (4) 2022: 451-457 - [c21]Kevin Baptista, Eugénia Moreira Bernardino, Anabela Moreira Bernardino:
Detecting SQL Injection Vulnerabilities Using Artificial Bee Colony and Ant Colony Optimization. WorldCIST (3) 2022: 273-283
2010 – 2019
- 2019
- [c20]Andreia Rocha, Joana Vilhena, Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Alexandrino Gonçalves, Rita M. T. Ascenso:
Bio&Med Search - A Platform to Help Health Professionals about Pharmacogenetics. CENTERIS/ProjMAN/HCist 2019: 692-697 - 2013
- [j4]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Swarm optimisation algorithms applied to large balanced communication networks. J. Netw. Comput. Appl. 36(1): 504-522 (2013) - 2012
- [j3]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Evolutionary Swarm based algorithms to minimise the link cost in Communication Networks. Int. J. Comput. Intell. Syst. 5(4): 745-761 (2012) - [j2]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Solving large-scale SONET network design problems using bee-inspired algorithms. Opt. Switch. Netw. 9(2): 97-117 (2012) - 2011
- [j1]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Solving ring loading problems using bio-inspired algorithms. J. Netw. Comput. Appl. 34(2): 668-685 (2011) - [c19]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Efficient Load Balancing Using the Bees Algorithm. IEA/AIE (2) 2011: 469-479 - [c18]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan M. Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Using a hybrid honey bees mating optimisation algorithm for solving SONET/SDH design problems. ISABEL 2011: 122:1-122:7 - [c17]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan M. Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Genetic and local search algorithms applied to balanced communication networks. ISABEL 2011: 124:1-124:6 - 2010
- [c16]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
A Hybrid Scatter Search algorithm to assign terminals to concentrators. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c15]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Efficient Load Balancing for a Resilient Packet Ring Using Artificial Bee Colony. EvoApplications (2) 2010: 61-70 - [c14]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
A Discrete Differential Evolution Algorithm for Solving the Weighted Ring Arc Loading Problem. IEA/AIE (2) 2010: 153-163 - [c13]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Using the Bees Algorithm to Assign Terminals to Concentrators. IEA/AIE (2) 2010: 267-276 - [c12]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Solving the Ring Arc-Loading Problem using a Hybrid Scatter Search Algorithm. IJCCI (ICEC) 2010: 60-69 - [c11]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Solving SONET Problems Using a Hybrid Scatter Search Algorithm. IJCCI (Selected Papers) 2010: 81-97 - [c10]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Hybrid Population-based Incremental Learning to Assign Terminals to Concentrators. IJCCI (ICEC) 2010: 182-189 - [c9]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Discrete Differential Evolution Algorithm for Solving the Terminal Assignment Problem. PPSN (2) 2010: 229-239 - [c8]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
A Hybrid Ant Colony Optimization Algorithm for Solving the Ring Arc-Loading Problem. SETN 2010: 49-59 - [c7]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
A Hybrid DE Algorithm with a Multiple Strategy for Solving the Terminal Assignment Problem. SETN 2010: 303-308
2000 – 2009
- 2009
- [c6]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
A Hybrid Ant Colony Optimization Algorithm for Solving the Terminal Assignment Problem. IJCCI 2009: 144-151 - [c5]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
Solving the Non-split Weighted Ring Arc-Loading Problem in a Resilient Packet Ring using Particle Swarm Optimization. IJCCI 2009: 230-236 - [c4]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez:
A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem. IWANN (2) 2009: 179-186 - [c3]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Solving the weighted ring edge-loading problem without demand splitting using a Hybrid Differential Evolution Algorithm. LCN 2009: 562-568 - 2008
- [c2]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm. DCAI 2008: 225-234 - [c1]Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators. DCAI 2008: 235-244 - [p1]Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
A Genetic Algorithm with Multiple Operators for Solving the Terminal Assignment Problem. New Challenges in Applied Intelligence Technologies 2008: 279-288
Coauthor Index
aka: Juan Manuel Sánchez-Pérez
aka: Miguel Ángel Vega Rodríguez
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:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint