default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura Climent
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Alejandro Arbelaez, Laura Climent:
Iterative local search for preserving data privacy. Appl. Intell. 55(2): 189 (2025)- 2024
- [j9]Laura Climent
, Alessio Longhi, Alejandro Arbelaez, Maurizio Mancini:
A framework for designing Reinforcement Learning agents with Dynamic Difficulty Adjustment in single-player action video games. Entertain. Comput. 50: 100686 (2024) - 2023
- [j8]Laura Climent, Alejandro Arbelaez:
Automatic assessment of object oriented programming assignments with unit testing in Python and a real case assignment. Comput. Appl. Eng. Educ. 31(5): 1321-1338 (2023) - [j7]Christian Pérez, Laura Climent, Giancarlo Nicolò, Alejandro Arbelaez, Miguel A. Salido:
A hybrid metaheuristic with learning for a real supply chain scheduling problem. Eng. Appl. Artif. Intell. 126(Part D): 107188 (2023) - 2022
- [c16]Jheisson López, Alejandro Arbelaez, Laura Climent:
Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains. CP 2022: 33:1-33:16 - [c15]César Loaiza Quintana, Laura Climent, Alejandro Arbelaez:
Iterated Local Search for the eBuses Charging Location Problem. PPSN (2) 2022: 338-351 - 2021
- [j6]Adejuyigbe O. Fajemisin, Laura Climent, Steven D. Prestwich:
An analytics-based heuristic decomposition of a bilevel multiple-follower cutting stock problem. OR Spectr. 43(3): 665-692 (2021) - 2020
- [c14]Elinga Pagalyte, Maurizio Mancini, Laura Climent:
Go with the Flow: Reinforcement Learning in Turn-based Battle Video Games. IVA 2020: 44:1-44:8 - [c13]Alejandro Arbelaez, Laura Climent:
Transition to eBuses with Minimal Timetable Disruptions. SOCS 2020: 119-120
2010 – 2019
- 2019
- [c12]Adejuyigbe O. Fajemisin, Laura Climent, Steven D. Prestwich:
Analytics-Based Decomposition of a Class of Bilevel Problems. WCGO 2019: 617-626 - 2017
- [c11]Hong Huang, Laura Climent, Barry O'Sullivan:
Acquiring Local Preferences of Weighted Partial MaxSAT. ICTAI 2017: 1065-1072 - 2016
- [j5]Laura Climent, Miguel A. Salido, Richard J. Wallace, Federico Barber:
Uncertainty in dynamic constraint satisfaction problems. AI Commun. 29(1): 239-241 (2016) - [j4]Laura Climent, Richard J. Wallace, Barry O'Sullivan, Eugene C. Freuder:
Extrapolating from Limited Uncertain Information in Large-Scale Combinatorial Optimization Problems to Obtain Robust Solutions. Int. J. Artif. Intell. Tools 25(1): 1660005:1-1660005:21 (2016) - [c10]Laura Climent, Barry O'Sullivan, Steven D. Prestwich:
Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection. LION 2016: 75-90 - [c9]Laura Climent, Barry O'Sullivan, Richard J. Wallace:
An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock Problem. SOCS 2016: 127-128 - 2015
- [j3]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings. Artif. Intell. Rev. 44(2): 131-156 (2015) - [j2]Laura Climent:
Robustness and stability in dynamic constraint satisfaction problems. Constraints An Int. J. 20(4): 502-503 (2015) - [c8]Steven D. Prestwich, Adejuyigbe O. Fajemisin, Laura Climent, Barry O'Sullivan:
Solving a Hard Cutting Stock Problem by Machine Learning and Optimisation. ECML/PKDD (1) 2015: 335-347 - 2014
- [j1]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty. J. Artif. Intell. Res. 49: 49-78 (2014) - [c7]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty - (Extended Abstract). CP 2014: 923-927 - [c6]Laura Climent, Richard J. Wallace, Barry O'Sullivan, Eugene C. Freuder:
Extrapolating from Limited Uncertain Information to Obtain Robust Solutions for Large-Scale Optimization Problems. ICTAI 2014: 898-905 - 2013
- [c5]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
Modeling Robustness in CSPs as Weighted CSPs. CPAIOR 2013: 44-60 - 2012
- [c4]Laura Climent, Richard J. Wallace, Miguel A. Salido, Federico Barber:
An Algorithm for Finding Robust and Stable Solutions for Constraint Satisfaction Problems with Discrete and Ordered Domains. ICTAI 2012: 874-879 - 2011
- [c3]Laura Climent, Miguel A. Salido, Federico Barber:
Reformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions. SARA 2011 - 2010
- [c2]Laura Climent, Miguel A. Salido, Federico Barber:
Robust Solutions in Changing Constraint Satisfaction Problems. IEA/AIE (1) 2010: 752-761
2000 – 2009
- 2009
- [c1]Laura Climent, Miguel A. Salido, Federico Barber:
Stability of Solutions in Constraint Satisfaction Problems. CCIA 2009: 301-309
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-21 00:00 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:
