Sciweavers

1453 search results - page 144 / 291
» Partial Constraint Satisfaction
Sort
View
AAAI
1996
15 years 5 months ago
Planning to Gather Information
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Chung T. Kwok, Daniel S. Weld
ER
2008
Springer
128views Database» more  ER 2008»
15 years 6 months ago
Temporal Constraints in Non-temporal Data Modelling Languages
It is common to find that the definition or common usage of a data modelling language causes there to be restrictions placed on the evolution of data values that are associated wit...
Peter McBrien
CP
2010
Springer
15 years 3 months ago
A Systematic Approach to MDD-Based Constraint Programming
Abstract. Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systemati...
Samid Hoda, Willem Jan van Hoeve, John N. Hooker
IAT
2008
IEEE
15 years 11 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...
FOCI
2007
IEEE
15 years 10 months ago
A New Reduction from 3SAT to n-Partite Graphs
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, ...