B
Barry O'Sullivan
Researcher at University College Cork
Publications - 324
Citations - 3966
Barry O'Sullivan is an academic researcher from University College Cork. The author has contributed to research in topics: Constraint programming & Constraint satisfaction problem. The author has an hindex of 29, co-authored 312 publications receiving 3610 citations. Previous affiliations of Barry O'Sullivan include Brown University & National University of Ireland.
Papers
More filters
Proceedings ArticleDOI
Energy Cost Management for Geographically Distributed Data Centres under Time-Variable Demands and Energy Prices
TL;DR: The Constraint Programming-based Large Neighbourhood Search (CP-LNS) approach significantly out-scales two commercial optimisation systems and provides a practical approach to lowering electricity costs for multiple geographically distributed data centres.
Proceedings ArticleDOI
Enhanced Inference for the Market Split Problem
TL;DR: This paper proposes a particular technique for enhancing inference in constraint programming, by generating deductions that involve tighter interleaving of constraints, and applies this method to the Market Split Problem and obtains massive speed-ups.
Proceedings ArticleDOI
Deployment case studies of an energy efficient protected LR-PON architecture
TL;DR: In a realistic LR-PON deployment up to a 40% reduction in power consumption can be achieved, compared to solutions adopting legacy 1+1 protection, by optimising the network deployment for energy efficient protection, and adopting a smart load balancing technique and a core node architecture that allows N:M protection of backup links.
Journal ArticleDOI
Reasoning about conditional constraint specification problems and feature models
TL;DR: It is shown that existing techniques from formal methods and answer set programming can be used to naturally model CCSPs and FMs and configurators automatically reason about the model itself, enumerating all solutions and discovering several kinds of model flaws.
Posted Content
Proteus: A Hierarchical Portfolio of Solvers and Transformations
TL;DR: This paper presents a novel hierarchical portfolio-based approach to CSP solving, which it is called Proteus, that does not rely purely on CSP solvers and may decide that it is best to encode a CSP problem instance into SAT, selecting an appropriate encoding and a corresponding SAT solver.