Sciweavers

673 search results - page 17 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
AICCSA
2006
IEEE
95views Hardware» more  AICCSA 2006»
14 years 1 months ago
DEPICT: A High-Level Formal Language For Modeling Constraint Satisfaction Problems
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
Abdulwahed M. Abbas, Edward P. K. Tsang, Ahmad H. ...
JFP
2008
97views more  JFP 2008»
13 years 6 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
CP
2004
Springer
14 years 28 days ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CP
2003
Springer
14 years 23 days ago
Using Case-Based Reasoning to Write Constraint Programs
Abstract. Constraint programming offers powerful problem solving capabilities, but experienced and skilled developers are needed to maximise the benefits it offers. We introduce...
James Little, Cormac Gebruers, Derek G. Bridge, Eu...