955 search results - page 78 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
AI
1998
Springer
14 years 9 days ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
CP
1998
Springer
14 years 9 days ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
ICCAD
1994
IEEE
14 years 6 days ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
DS
1997
13 years 9 months ago
1997
This paper motivates a comprehensive methodological framework for dealing with some aspects of real-world complexity in information system analysis and design. By complex applicat...