Search Results for author:
Found 5 papers, 0 papers with code
Enhancing Security via Deliberate Unpredictability of Solutions in Optimisation
The main aim of decision support systems is to find solutions that satisfy user requirements.
Discrete Mathematics
Algorithm Configuration: Learning policies for the quick termination of poor performers
One way to speed up the algorithm configuration task is to use short runs instead of long runs as much as possible, but without discarding the configurations that eventually do well on the long runs.
Markov Chain methods for the bipartite Boolean quadratic programming problem
We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP).
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints
We also introduce new pseudo-Boolean (PB) and Constraint Satisfaction (CSP) formulations of the WSP with UI constraints which efficiently exploit this new decomposition of the problem and raise the novel issue of how to use general-purpose solvers to tackle FPT problems in a fashion that meets FPT efficiency expectations.
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem
Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem.
