717 search results - page 38 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
ERCIMDL
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a research proposal on user -oriented evaluation method to compar e the usability of Internet search tools. Cognitive style and problem solving style are identi...
IAT
2003
IEEE
15 years 3 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
109
click to vote
AAAI
1994
14 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
SMA
2006
ACM
15 years 3 months ago
2006
ACM
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...