1453 search results - page 181 / 291 » Partial Constraint Satisfaction |
127
click to vote
CSCLP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
153
Voted
ECAI
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
137
Voted
ICMCS
1999
IEEE
15 years 9 months ago
1999
IEEE
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
173
click to vote
CSMR
1998
IEEE
15 years 9 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
141
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...