default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlejandro Arbelaez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]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)- [i1]Alejandro Arbelaez, Charlotte Truchet, Philippe Codognet:
Using Sequential Runtime Distributions for the Parallel Speedup Prediction of SAT Local Search. CoRR abs/2403.08790 (2024) - 2023
- [j7]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) - [j6]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
- [c27]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 - [c26]César Loaiza Quintana, Laura Climent, Alejandro Arbelaez:
Iterated Local Search for the eBuses Charging Location Problem. PPSN (2) 2022: 338-351 - 2020
- [c25]Padraigh Jarvis, Alejandro Arbelaez:
Cooperative Parallel SAT Local Search with Path Relinking. EvoCOP 2020: 83-98 - [c24]Alejandro Arbelaez, Laura Climent:
Transition to eBuses with Minimal Timetable Disruptions. SOCS 2020: 119-120
2010 – 2019
- 2018
- [j5]Robinson Duque, Alejandro Arbelaez, Juan Francisco Díaz:
Online over time processing of combinatorial problems. Constraints An Int. J. 23(3): 310-334 (2018) - [j4]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. J. Heuristics 24(3): 359-394 (2018) - [c23]Robinson Duque, Alejandro Arbelaez, Juan Francisco Díaz:
Processing Online SAT Instances with Waiting Time Constraints and Completion Weights. LOD 2018: 418-430 - [p2]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks. Handbook of Parallel Constraint Reasoning 2018: 633-665 - 2017
- [j3]Marco Ruffini, Mohand Achouche, Alejandro Arbelaez, René Bonk, Andrea Di Giglio, Nick J. Doran, Marija Furdek, R. Jensen, Julio Montalvo-Garcia, Nicholas Parsons, Thomas Pfeiffer, Luis Quesada, Christian Raack, Harald Rohde, Marco Schiano, Giuseppe Talli, Paul D. Townsend, Roland Wessäly, Lena Wosinska, Xin Yin, David B. Payne:
Access and Metro Network Convergence for Flexible End-to-End Network Design [Invited]. JOCN 9(6): 524-535 (2017) - [c22]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Ata Sasmaz:
Generation of a reference network for Ireland and its contribution to the design of an optical network architecture. ICTON 2017: 1-4 - [c21]David B. Payne, Alejandro Arbelaez, René Bonk, Nick J. Doran, Marija Furdek, R. Jensen, Nick Parsons, Thomas Pfeiffer, Luis Quesada, Christian Raack, Giuseppe Talli, Paul D. Townsend, Roland Wessäly, Lena Wosinska, Xin Yin, Marco Ruffini:
End-to-end network design and experimentation in the DISCUS project. ICTON 2017: 1-6 - 2016
- [j2]Charlotte Truchet, Alejandro Arbelaez, Florian Richoux, Philippe Codognet:
Estimating parallel runtimes for randomized algorithms in constraint solving. J. Heuristics 22(4): 613-648 (2016) - [c20]Robinson Duque, Juan Francisco Díaz, Alejandro Arbelaez:
SABIO: An Implementation of MIP and CP for Interactive Soccer Queries. CP 2016: 575-583 - [c19]Alejandro Arbelaez, Charlotte Truchet, Barry O'Sullivan:
Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms. ICTAI 2016: 655-662 - [c18]Alejandro Arbelaez, Barry O'Sullivan:
Learning a Stopping Criterion for Local Search. LION 2016: 3-16 - [c17]Robinson Duque, Juan Francisco Díaz, Alejandro Arbelaez:
Constraint Programming and Machine Learning for Interactive Soccer Analysis. LION 2016: 240-246 - [c16]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Comparing tree and chain topologies for designing resilient backhaul access network. ONDM 2016: 1-6 - 2015
- [c15]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan:
Constraint-Based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks. CP 2015: 499-507 - [c14]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem. CPAIOR 2015: 31-46 - [c13]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Optimising dual homing for long-reach passive optical networks. DRCN 2015: 235-242 - [c12]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
A scalable approach for computing distance-bounded node-disjoint paths in optical networks. ICTON 2015: 1-4 - [c11]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A constraint-based local search for designing tree networks with distance and disjoint constraints. RNDM@WMNC 2015: 128-134 - 2014
- [c10]Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem. ICTAI 2014: 178-185 - [c9]Alejandro Arbelaez, Philippe Codognet:
A GPU Implementation of Parallel Constraint-Based Local Search. PDP 2014: 648-655 - 2013
- [j1]Alejandro Arbelaez, Charlotte Truchet, Philippe Codognet:
Using sequential runtime distributions for the parallel speedup prediction of SAT local search. Theory Pract. Log. Program. 13(4-5): 625-639 (2013) - [c8]Alejandro Arbelaez, Philippe Codognet:
From Sequential to Parallel Local Search for SAT. EvoCOP 2013: 157-168 - [c7]Alejandro Arbelaez, Luis Quesada:
Parallelising the k-Medoids Clustering Problem Using Space-Partitioning. SOCS 2013: 20-28 - 2012
- [c6]Alejandro Arbelaez, Philippe Codognet:
Massively Parallel Local Search for SAT. ICTAI 2012: 57-64 - [c5]Alejandro Arbelaez, Philippe Codognet:
Towards Massively Parallel Local Search for SAT - (Poster Presentation). SAT 2012: 481-482 - [p1]Alejandro Arbelaez, Youssef Hamadi, Michèle Sebag:
Continuous Search in Constraint Programming. Autonomous Search 2012: 219-243 - 2011
- [c4]Alejandro Arbelaez, Youssef Hamadi:
Improving Parallel Local Search for SAT. LION 2011: 46-60 - 2010
- [c3]Alejandro Arbelaez, Youssef Hamadi, Michèle Sebag:
Building Portfolios for the Protein Structure Prediction Problem. WCB@ICLP 2010: 2-7 - [c2]Alejandro Arbelaez, Youssef Hamadi, Michèle Sebag:
Continuous Search in Constraint Programming. ICTAI (1) 2010: 53-60
2000 – 2009
- 2009
- [c1]Alejandro Arbelaez, Youssef Hamadi:
Exploiting weak dependencies in tree-based search. SAC 2009: 1385-1391
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-10-07 21:21 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:
