Sciweavers

CP
2011
Springer
12 years 11 months ago
Skill-based differences in option generation in a complex task: a verbal protocol analysis
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...
CP
2011
Springer
12 years 11 months ago
Hierarchically Nested Convex VCSP
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...
Martin C. Cooper, Stanislav Zivny
CP
2011
Springer
12 years 11 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
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.,...
Nic Wilson, Walid Trabelsi
CP
2011
Springer
12 years 11 months ago
Algorithm Selection and Scheduling
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, ...
CP
2011
Springer
12 years 11 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
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...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
CP
2011
Springer
12 years 11 months ago
Optimal Carpet Cutting
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
CP
2011
Springer
12 years 11 months ago
Incorporating Variance in Impact-Based Search
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...
CP
2011
Springer
12 years 11 months ago
CP Models for Maximum Common Subgraph Problems
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, ...
Samba Ndojh Ndiaye, Christine Solnon