Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
This paper presents a novel domain-consistency algorithm which does not maintain supports dynamically during propagation, but rather maintain forbidden values. It introduces the op...
Abstract. Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systemati...
Personalisation and context-awareness are fundamental concerns in Telephony. This paper introduces a rule-based system - 4CRULES - which enables context-sensitive call control by t...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
Roman van der Krogt, Jacob Feldman, James Little, ...
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...