default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEunice López-Camacho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Elvira G. Rincón Flores, Eunice López-Camacho, Juanjo Mena, Omar Olmos López:
Teaching through Learning Analytics: Predicting Student Learning Profiles in a Physics Course at a Higher Education Institution. Int. J. Interact. Multim. Artif. Intell. 7(7): 82 (2022)- 2021
- [c9]Elvira G. Rincón Flores, Jesús Alexei Mendoza Moreno, Eunice López-Camacho, Juanjo Mena
:
Learning Spaces for a Competency-based Model: Post-occupancy Evaluation. EDUCON 2021: 360-365 - 2020
- [c8]Elvira G. Rincón Flores, Eunice López-Camacho, Juanjo Mena, Omar Olmos López:
Predicting academic performance with Artificial Intelligence (AI), a new tool for teachers and students. EDUCON 2020: 1049-1054 - [c7]Elvira G. Rincón Flores, Eunice López-Camacho, Omar Olmos López:
Engaging a Calculus Course with Telepresence through Gamification. EDUCON 2020: 1055-1059
2010 – 2019
- 2019
- [c6]Elvira G. Rincón Flores, Juanjo Mena, Eunice López-Camacho, Omar Olmos López:
Adaptive learning based on AI with predictive algorithms. TEEM 2019: 607-612 - 2014
- [j3]Eunice López-Camacho, Hugo Terashima-Marín, Peter Ross, Gabriela Ochoa:
A unified hyper-heuristic framework for solving bin packing problems. Expert Syst. Appl. 41(15): 6876-6889 (2014) - 2013
- [j2]Eunice López-Camacho, Gabriela Ochoa, Hugo Terashima-Marín, Edmund K. Burke:
An effective heuristic for the two-dimensional irregular bin packing problem. Ann. Oper. Res. 206(1): 241-264 (2013) - [c5]Eunice López-Camacho, Hugo Terashima-Marín:
Evolving feature selection for characterizing and solving the 1D and 2D bin packing problem. IEEE Congress on Evolutionary Computation 2013: 2094-2101 - 2012
- [c4]Eunice López-Camacho, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
The impact of the bin packing problem structure in hyper-heuristic performance. GECCO (Companion) 2012: 1545-1546 - 2011
- [c3]Eunice López-Camacho, Hugo Terashima-Marín, Peter Ross:
A hyper-heuristic for solving one and two-dimensional bin packing problems. GECCO (Companion) 2011: 257-258 - 2010
- [j1]Hugo Terashima-Marín, Peter Ross, Cláudia J. Farías Zárate, Eunice López-Camacho, Manuel Valenzuela-Rendón:
Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems. Ann. Oper. Res. 179(1): 369-392 (2010) - [c2]Eunice López-Camacho, Hugo Terashima-Marín, Peter Ross, Manuel Valenzuela-Rendón:
Problem-state representations in a hyper-heuristic approach for the 2D irregular BPP. GECCO 2010: 297-298 - [c1]Eunice López-Camacho, Hugo Terashima-Marín, Peter Ross:
Defining a Problem-State Representation with Data Mining within a Hyper-heuristic Model Which Solves 2D Irregular Bin Packing Problems. IBERAMIA 2010: 204-213
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 2025-01-09 13:07 CET 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:
