714 search results - page 98 / 143 » Lexicographically-ordered constraint satisfaction problems |
IAT
2008
IEEE
14 years 4 months ago
2008
IEEE
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...
ACMICEC
2006
ACM
14 years 3 months ago
2006
ACM
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...
CONSTRAINTS
2002
13 years 9 months ago
2002
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...
AAAI
2006
13 years 11 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
AAAI
2000
13 years 11 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...