32 search results - page 3 / 7 » Relaxations of semiring constraint satisfaction problems |
KCAP
2005
ACM
13 years 11 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
AICCSA
2001
IEEE
13 years 9 months ago
2001
IEEE
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
ECSQARU
2009
Springer
13 years 3 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
ICCD
2007
IEEE
14 years 2 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...