![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Amilkar Puris
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j6]Jesennia Cárdenas-Cobo
, Amilkar Puris
, Pavel Novoa-Hernández
, José Angel Galindo
, David Benavides
:
Recommender Systems and Scratch: An Integrated Approach for Enhancing Computer Programming Learning. IEEE Trans. Learn. Technol. 13(2): 387-403 (2020)
2010 – 2019
- 2016
- [j5]Byron Oviedo
, Serafín Moral, Amilkar Puris:
A hierarchical clustering method: Applications to educational data. Intell. Data Anal. 20(4): 933-951 (2016) - [c7]Byron Oviedo
, Luís Moreira, Amilkar Puris, Pavel Novoa-Hernández
, Serafín Moral:
Learning Bayesian network by a mesh of points. CEC 2016: 3983-3989 - 2013
- [j4]Ricardo Navarro, Amilkar Puris, Rafael Bello:
The performance of some meta-heuristics in continuous problems studied according to the location of the optima in the search space. Rev. Avances en Sistemas Informática 10(1): 60-66 (2013) - [c6]Daniel Molina
, Amilkar Puris
, Rafael Bello
, Francisco Herrera:
Variable mesh optimization for the 2013 CEC Special Session Niching Methods for Multimodal Optimization. IEEE Congress on Evolutionary Computation 2013: 87-94 - 2012
- [j3]Amilkar Puris
, Rafael Bello
, Daniel Molina
, Francisco Herrera
:
Variable mesh optimization for continuous optimization problems. Soft Comput. 16(3): 511-525 (2012) - [c5]Amilkar Puris
, Rafael Bello
, Daniel Molina
, Francisco Herrera:
Optimising real parameters using the information of a mesh of solutions: VMO algorithm. IEEE Congress on Evolutionary Computation 2012: 1-7 - 2010
- [j2]Amilkar Puris
, Rafael Bello
, Francisco Herrera
:
Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP. Expert Syst. Appl. 37(7): 5443-5453 (2010)
2000 – 2009
- 2008
- [j1]Yudel Gómez, Rafael Bello, Amilkar Puris, María M. García, Ann Nowé:
Two Step Swarm Intelligence to Solve the Feature Selection Problem. J. Univers. Comput. Sci. 14(15): 2582-2596 (2008) - [c4]Rafael Bello
, Amilkar Puris
, Rafael Falcón, Yudel Gómez:
Feature Selection through Dynamic Mesh Optimization. CIARP 2008: 348-355 - 2007
- [c3]Amilkar Puris, Rafael Bello, Yaima Trujillo, Ann Nowé, Yailen Martínez:
Two-Stage ACO to Solve the Job Shop Scheduling Problem. CIARP 2007: 447-456 - [c2]Amilkar Puris, Rafael Bello, Yailen Martínez, Ann Nowé:
Two-Stage Ant Colony Optimization for Solving the Traveling Salesman Problem. IWINAC (2) 2007: 307-316 - 2006
- [c1]Rafael Bello, Amilkar Puris, Ann Nowé, Yailen Martínez, María M. García:
Two Step Ant Colony System to Solve the Feature Selection Problem. CIARP 2006: 588-596
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-09 05:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint