30 search results - page 4 / 6 » A Tribute to Eugene Freuder |
CP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
CP
1998
Springer
13 years 10 months ago
1998
Springer
In this paper we describe a paradigm for contentfocused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceiv...
CP
1995
Springer
13 years 10 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
AAAI
2004
13 years 7 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
IAAI
2001
13 years 7 months ago
2001
ADIOP is an application for Automated Diagnosis of InterOperability Problems. Interoperability testing involves checking the degree of compatibility between two networking devices...