This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retain by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
A. Arbelaez, L. Climent. Iterative local search for preserving data privacy. Applied Intelligence. (pdf, bibtex)
L. Climent, A. Longhi, A. Arbelaez, M. Mancini. A framework for designing Reinforcement Learning agents with Dynamic Difficulty Adjustment in single-player action video games. Entertainment Computing. (pdf)
C. Pérez, L. Climent, G. Nicoló, A. Arbelaez, M. A. Salido. Hybrid Metaheuristic with Learning for a Real Supply Chain Scheduling problem. Engineering Applications of Artificial Intelligence. (pdf, bibtex)
P. Jarvis, L. Climent, A. Arbelaez. Smart and Sustainable Scheduling of Charging Events for Electric Buses. TOP - An Official Journal of the Spanish Society of Statistics and Operations Research. (pdf, bibtex)
L. Climent, A. Arbelaez. Automatic assessment of object oriented programming assignments with unit testing in Python and a real case assignment. Computer Applications in Engineering Education. (pdf, bibtex)
C. Loaiza-Quintana, A. Arbelaez, L. Climent. Robust eBuses Charging Location Problem. IEEE Open Journal of Intelligent Transportation Systems. (pdf, bibtex)
R. Duque, A. Arbelaez, J. F. Diaz. Online Over Time Processing of Combinatorial Problems. Constraints. (pdf, bibtex)
R. Duque, A. Arbelaez, J. F. Diaz. CP and MIP Approaches for Soccer Analysis. Journal of Industrial and Management Optimization (pdf, bibtex)
C. Truchet, A. Arbelaez, F. Richoux, P. Codognet. Estimating Parallel Runtimes for Randomized Algorithms in Constraint Solving. J. of Heuristics (pdf, bibtex)
A. Arbelaez, C. Truchet, P. Codognet. Using Runtime Distributions for the Analysis and Parallelization of Local Search for SAT. TPLP (pdf, bibtex)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. A Constraint-Based Parallel Local Search for the Edge-Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem. J. of Heuristics (pdf, bibtex)
M. Ruffini, M. Achouche, A. Arbelaez, R. Bonk, A. Di Giglio, N. J. Doran, M. Furdek, R. Jensen, J. Montalvo, N. Parsons, T. Pfeiffer, L. Quesada, C. Raack, H. Rohde, M. Schiano, G. Talli, P. Townsend, R. Wessaly, L. Wosinska, X. Yin and D.B. Payne. Access and metro network convergence for flexible end to end network design. (pdf, bibtex)
A. Arbelaez, Y. Hamadi, M. Sebag. Continuous Search in Constraint Programming. Chapter in Autonomous Search. Springer Verlag (doi)
A. Arbelaez, Deepak Mehta, Barry O’Sullivan, Luis Quesada. Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks. Chapter in Handbook of Parallel Constraint Reasoning. Springer, Cham (doi)
P. Jarvis, L. Climent, A. Arbelaez. Multi-objective mixed bus fleet charging schedule problem with Time-of-Use for real-world data-sets. AICS 2024 (pdf, bibtex)
C. Loaiza Quintana, L. Climent, A. Arbelaez: Iterated Local Search for the eBuses Charging Location Problem. PPSN 2022 (pdf, bibtex)
J. López, A. Arbelaez, L. Climent: Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains. CP 2022 (pdf, bibtex).
P. Jarvis, L. Climent, A. Arbelaez. Smart and Sustainable Scheduling of Charging Events for Electric Buses. EvEUCoP 2022 (pdf, bibtex)
A. Arbelaez, L. Climent. Transition to eBuses With Minimal Timetable Disruptions. SoCS 2020 (pdf, bibtex)
P. Jarvis , A. Arbelaez. Cooperative Parallel SAT Local Search with Path Relinking. EvoCOP 2020 (pdf, bibtex)
R. Duque, A. Arbelaez, J. F. Diaz. Processing Online SAT Instances with Waiting Time Constraints and Completion Weights. LOD 2018 (pdf).
R. Duque, A. Arbelaez, J. F. Diaz. Online Over Time Processing of Combinatorial Problems (Abstract). CPAIOR 2018. (pdf)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada, and A. Sasmaz. Generation of A Reference Network for Ireland and its Contribution to the Design of An Optical Network Architecture. ICTON 2017. (pdf)
D. B. Payne, A. Arbelaez, R. Bonk, N. J. Doran, M. Furdek, R. Jensen, N. Parsons, T. Pfeiffer, L. Quesada, C. Raack, G. Talli, P. Townsend, R. Wessaly, L. Wosinska, X. Yin, M. Ruffini. End-to-end network design and experimentation in the DISCUS project. ICTON 2017. (pdf)
R. Duque, A. Arbelaez, J. F. Diaz. Off-line and On-line Scheduling of SAT Instances with Time Processing Constraints. CCC 2017. (pdf)
A. Arbelaez, C. Truchet, B. O'Sullivan. Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms. ICTAI 2016 (pdf, data)
R. Duque, J. F. Diaz, A. Arbelaez. SABIO: An Implementation of MIP and CP for Interactive Soccer Queries. CP 2016 (pdf, bibtex )
R. Duque, J. F. Diaz, A. Arbelaez. Constraint Programming and Machine Learning for Interactive Soccer Analysis. LION 2016 (pdf)
A. Arbelaez, B. O'Sullivan. Learning a Stopping Criteria for Local Search. LION 2016 (pdf)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. Comparing Tree and Chain Topologies for Designing Resilient Backhaul Access Network. ONDM 2016 (pdf, bibtex)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. A Constraint-based Local Search for Designing Tree Networks with Distance and Disjoint Constraints. RNDM 2015 (pdf, bibtex)
A. Arbelaez, D. Mehta, B. O'Sullivan. Constraint-based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks. CP 2015 (pdf, bibtex)
A. Arbelaez, D. Mehta, B. O'Sullivan, C. Ozturk, L. Quesada. A Scalable Approach for Computing Distance-Bounded Node-Disjoint Paths in Long-Reach Passive Optical Networks and Transparent Optical Core Networks. Invited Paper, ICTON 2015 (pdf, bibtex)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. Optimising Dual Homing for Long-reach Passive Optical Networks. DRCN 2015 (pdf, bibtex)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrainted Minimum Spanning Tree Problem. CPAIOR 2015 (pdf, bibtex)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem. ICTAI 2014 (pdf, bibtex )
A. Arbelaez, P. Codognet. A GPU Implementation of Parallel Constraint-based Local Search. PDP 2014 (pdf, bibtex)
A. Arbelaez, L. Quesada. Parallielising the k-Medoids Clustering Problem Using Space Partitioning. SOCS 2013 (pdf, bibtex)
A. Arbelaez, P. Codognet. From Sequential to Parallel Local Search for SAT. EvoCOP 2013 (pdf, bibtex)
A. Arbelaez, P. Codognet. Massively Parallel Local Search for SAT. ICTAI 2012 (pdf, bibtex)
A. Arbelaez, P. Codognet. Towards Massively Parallel Local Search for SAT (Poster Presentation). SAT 2012 (pdf, bibtex)
A. Arbelaez, Y. Hamadi. Improving Parallel Local Search for SAT. LION 2011. (pdf, bibtex)
A. Arbelaez, Y. Hamadi. Continuous Search in Constraint Programming. ICTAI 2010. (pdf, bibtex)
A. Arbelaez, Y. Hamadi. Exploiting Weak Dependencies in Tree-based Search. SAC 2009. (pdf, bibtex)
A. Arbelaez, J. Gutierrez, C. Rueda, C. Olarge. A Generic Framework to Model, Verify and Simulate Genetic Regulatory Networks. CLEI 2006.
A. Arbelaez, J. Gutierrez, J. Perez. Timed CCP in Systems Biology. The ALP Newsletter Vol. 19, No 4. Nov-Dec 2006. (doi)
C. Ozturk, A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. A Scalable Approach for Distance-Bounded Disjoint Paths Problems in Telecommunication Networks. Euro 2015, (Presentation Abstract-only)
A. Arbelaez, C. Truchet, P. Codognet. on the Parallelization of Randomized Propagation-based Constraint Solving. ParSearchOpt 2014. (pdf)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada. A Constraint-based parallel Local Search for Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem. ParSearchOpt 2014. (pdf)
A. Arbelaez, D. Mehta, B. O'Sullivan, L. Quesada, M. Ruffini, D. Payne, L. Doyle. A Local Search Approach to Finding Distance-Constrained Disjoint Paths in Long-Reach Passive Optical Networks. INFORMS Telecom 2014. (Presentation abstract-only)
A. Arbelaez, P. Codognet. Parallel Local Search for SAT. CPAIOR 2013, (Presentation Abstract-only)
A. Arbelaez, C. Truchet, P. Codognet. Estimating the Runtime of Parallel SAT Local Search. MIC 2013. (pdf)
A. Arbelaez, P. Codognet. A Survey of Parallel Local Search for SAT. Theory, Implementation, and Applications of SAT Technology. Workshop at JSAI 2013. (pdf)
A. Arbelaez, Y. Hamadi. Cooperative Stochastic Local Search. SAT competition 2011.
A. Arbelaez, Y. Hamadi, M. Sebag. Building Portfolios for the Protein Folding Problem. WBC 2010. (pdf)
A. Arbelaez, Y. Hamadi. Continuous Search in Constraint Programming. CP 2009 Doctoral Program. (pdf)
A. Arbelaez, Y. Hamadi, M. Sebag. Online Heuristic Selection in Constraint Programming. SOCS 2009. (pdf)
A. Arbelaez. Learning During Search.