Search Results for author: Barry O'Sullivan

Found 11 papers, 0 papers with code

Privacy Interpretation of Behavioural-based Anomaly Detection Approaches

no code implementations21 Dec 2020 Muhammad Imran Khan, Simon Foley, Barry O'Sullivan

It is shown that in this paper that behavioural-based anomaly detection approaches have the potential to detect privacy attacks based on query sequences (violation of formal privacy definition) as privacy-anomalies.

Anomaly Detection Cryptography and Security

Generating Difficult SAT Instances by Preventing Triangles

no code implementations8 Mar 2019 Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich

When creating benchmarks for SAT solvers, we need SAT instances that are easy to build but hard to solve.

On the Complexity of Robust Stable Marriage

no code implementations18 Sep 2017 Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan

Then, we show the equivalence between the SAT formulation and finding a (1, 1)-supermatch on a specific family of instances.

Finding Robust Solutions to Stable Marriage

no code implementations24 May 2017 Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin

We first define robustness by introducing (a, b)-supermatches.

Elastic Solver: Balancing Solution Time and Energy Consumption

no code implementations23 May 2016 Barry Hurley, Deepak Mehta, Barry O'Sullivan

We analyse the impact of the number of machines (or cores) on not only solution time but also on energy consumption.

The Inductive Constraint Programming Loop

no code implementations12 Oct 2015 Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis

Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems.

Soft Constraints of Difference and Equality

no code implementations16 Jan 2014 Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon

Moreover, we show that the maximum number of pairs of equal variables can be approximated by a factor 1/2 with a linear time greedy algorithm.

Developing Approaches for Solving a Telecommunications Feature Subscription Problem

no code implementations16 Jan 2014 David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson

Call control features (e. g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service.

Transformation-based Feature Computation for Algorithm Portfolios

no code implementations10 Jan 2014 Barry Hurley, Serdar Kadioglu, Yuri Malitsky, Barry O'Sullivan

For a portfolio approach to be effective there are two crucial conditions that must be met.

Proteus: A Hierarchical Portfolio of Solvers and Transformations

no code implementations24 Jun 2013 Barry Hurley, Lars Kotthoff, Yuri Malitsky, Barry O'Sullivan

In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common.

Cannot find the paper you are looking for? You can Submit a new open access paper.