Sciweavers

601 search results - page 41 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
AI
1998
Springer
15 years 5 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
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 ...
Don Banks, Peter van Beek, Amnon Meisels
ISDA
2010
IEEE
14 years 11 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
117
Voted
CP
1998
Springer
15 years 5 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
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...
Stephan Pontow
ENTCS
2007
113views more  ENTCS 2007»
15 years 1 months ago
On the Decidability of the Safety Problem for Access Control Policies
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...
E. Kleiner, T. Newcomb
CP
2004
Springer
15 years 7 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...