729 search results - page 19 / 146 » Solving subgraph isomorphism problems with constraint progra... |
CONSTRAINTS
2011
14 years 4 months ago
2011
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
75
Voted
ICWL
2007
Springer
15 years 3 months ago
2007
Springer
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...
CP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
FLOPS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...