8 search results - page 1 / 2 » Constraint Satisfaction with Succinctly Specified Relations |
DAGSTUHL
2006
13 years 6 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
ECAI
2000
Springer
13 years 9 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...
JAIR
2010
13 years 3 months ago
2010
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
CCR
2004
13 years 4 months ago
2004
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
SPATIALCOGNITION
2000
Springer
13 years 8 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...