In recent models of decision-making, cognitive scientists have examined the relationship between option generation and successful performance. These models suggest that those who a...
Paul Ward, Joel Suss, David W. Eccles, A. Mark Wil...
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Abstract. In this paper we present a model for the carpet cutting problem in which carpet shapes are cut from a rectangular carpet roll with a fixed width and sufficiently long le...
Andreas Schutt, Peter J. Stuckey, Andrew R. Verden
We present a simple modification to the idea of impact-based search which has proven highly effective for several applications. Impacts measure the average reduction in search spa...
Serdar Kadioglu, Eoin O'Mahony, Philippe Refalo, M...
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...