Search Results for author:
Found 15 papers, 1 papers with code
Key Factors Affecting European Reactions to AI in European Full and Flawed Democracies
This study examines the key factors that affect European reactions to artificial intelligence (AI) in the context of both full and flawed democracies in Europe.
Generation and Prediction of Difficult Model Counting Instances
We present a way to create small yet difficult model counting instances.
SATfeatPy - A Python-based Feature Extraction System for Satisfiability
This paper introduces SATfeatPy, a library that offers feature extraction techniques for SAT problems in the CNF form.
Finding Counterfactual Explanations through Constraint Relaxations
Interactive constraint systems often suffer from infeasibility (no solution) due to conflicting user constraints.
Privacy Interpretation of Behavioural-based Anomaly Detection Approaches
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
Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior
We present in this paper our solver for logic grid puzzles.
Generating Difficult SAT Instances by Preventing Triangles
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
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
We first define robustness by introducing (a, b)-supermatches.
Elastic Solver: Balancing Solution Time and Energy Consumption
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
Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems.
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e. g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service.
Soft Constraints of Difference and Equality
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.
Transformation-based Feature Computation for Algorithm Portfolios
For a portfolio approach to be effective there are two crucial conditions that must be met.
Proteus: A Hierarchical Portfolio of Solvers and Transformations
In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common.
