37 search results - page 1 / 8 » Completable Partial Solutions in Constraint Programming and ... |
CP
2004
Springer
15 years 3 months ago
2004
Springer
83
Voted
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
81
Voted
COMSIS
2006
14 years 10 months ago
2006
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
84
Voted
ADBIS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
78
Voted
EAAI
2008
14 years 10 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...