Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Barry Hurley 0001

dblp:10/9508-1 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 85% Embedded and real-time systems · 15%
Theoretical computer science
2 papers
Computational complexity · 42% Algorithms and data structures · 42% Mathematical optimization · 16%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%

Topics — the 4 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Energy systems and smart grids › energy management
energy cost minimization
0.212016
Optimizing Energy Costs in a Zinc and Lead Mine · AAAI 2016
Performance modeling and evaluation › performance prediction
execution time prediction
0.212015
Statistical Regimes and Runtime Prediction · IJCAI 2015
Algorithms and data structures › algorithm engineering
algorithm selection
0.212013
Problem Transformations and Algorithm Selection for CSPs · IJCAI 2013
Computational complexity
constraint satisfaction
0.212013
Problem Transformations and Algorithm Selection for CSPs · IJCAI 2013

Methods — techniques the papers use, named apart from their topics

smart meter data · 0.5scheduling · 0.5real-time data streams · 0.5statistical analysis · 0.4runtime prediction · 0.4
YearPublicationVenuePosition
2016 Optimizing Energy Costs in a Zinc and Lead Mine
abstract
Boliden Tara Mines Ltd. consumed 184.7 GWh of electricity in 2014, equating to over 1% of the national demand of Ireland or approximately 35,000 homes. Ireland’s industrial electricity prices, at an average of 13 c/KWh in 2014, are amongst the most expensive in Europe. Cost effective electricity procurement is ever more pressing for businesses to remain competitive. In parallel, the proliferation of intelligent devices has led to the industrial Internet of Things paradigm becoming mainstream. As more and more devices become equipped with network connectivity, smart metering is fast becoming a means of giving energy users access to a rich array of consumption data. These modern sensor networks have facilitated the development of applications to process, analyse, and react to continuous data streams in real-time. Subsequently, future procurement and consumption decisions can be informed by a highly detailed evaluation of energy usage. With these considerations in mind, this paper uses variable energy prices from Ireland’s Single Electricity Market, along with smart meter sensor data, to simulate the scheduling of an industrial-sized underground pump station in Tara Mines. The objective is to reduce the overall energy costs whilst still functioning within the system’s operational constraints. An evaluation using real-world electricity prices and detailed sensor data for 2014 demonstrates significant savings of up to 10.72% over the year compared to the existing control systems.
Alan Kinsella, Alan F. Smeaton, Barry Hurley 0001, Barry O'Sullivan, Helmut Simonis
AAAI3
2015 Large Neighbourhood Search for Energy-Efficient Train Timetabling
abstract
The electric rail sector, like many sectors, is looking for means to reduce its energy consumption and energy cost. In this work we consider the scenario where the utility provider charges based on the maximum consumption over a period. Therefore one wishes to schedule the departure of trains such that the aggregate load is balanced across time periods while satisfying timetabling and resource restrictions. We present an approach which combines the strengths of a number of research areas such as constraint programming, linear programming, mixed-integer programming, and large neighbourhood search. The empirical performance on instances from an ongoing research challenge demonstrates the approach's ability to dramatically reduce the overall energy cost. In addition, we are able to close a number of the instances for which we prove optimality.
Diarmuid Grimes, Barry Hurley 0001, Deepak Mehta 0001, Barry O'Sullivan
ICTAI2
2015 Statistical Regimes and Runtime Prediction
Barry Hurley 0001, Barry O'Sullivan
IJCAI1
2014 Proteus: A Hierarchical Portfolio of Solvers and Transformations
Barry Hurley 0001, Lars Kotthoff, Yuri Malitsky, Barry O'Sullivan
CPAIOR1
2013 Problem Transformations and Algorithm Selection for CSPs
Barry Hurley 0001, Barry O'Sullivan
IJCAI1
2012 Adaptation in a CBR-Based Solver Portfolio for the Satisfiability Problem
Barry Hurley 0001, Barry O'Sullivan
ICCBR1