Sciweavers

1300 search results - page 144 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
CP
2000
Springer
15 years 2 months ago
Extending Forward Checking
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
Fahiem Bacchus
KBS
2007
103views more  KBS 2007»
14 years 9 months ago
A reusable commitment management service using Semantic Web technology
Commitment management is a key issue in service-provisioning in the context of virtual organisations (VOs). A service-provider — which may be a single agent acting within an orga...
Alun D. Preece, Stuart Chalmers, Craig McKenzie
IAT
2008
IEEE
15 years 4 months ago
Competency-Based Intelligent Curriculum Sequencing: Comparing Two Evolutionary Approaches
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
Luis de Marcos, Roberto Barchino, José-Javi...
DATAMINE
2010
166views more  DATAMINE 2010»
14 years 10 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
CP
2000
Springer
15 years 2 months ago
Maintaining Arc-Consistency within Dynamic Backtracking
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...