Sciweavers

2834 search results - page 298 / 567
» Representing Trees with Constraints
Sort
View
CP
1998
Springer
15 years 10 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
CEC
2007
IEEE
15 years 10 months ago
A hybrid evolutionary approach to the university course timetabling problem
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
Salwani Abdullah, Edmund K. Burke, Barry McCollum
DAC
2010
ACM
15 years 10 months ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert
PATAT
2000
Springer
89views Education» more  PATAT 2000»
15 years 10 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
VLDB
1991
ACM
168views Database» more  VLDB 1991»
15 years 10 months ago
Semantic Modeling of Object Oriented Databases
: This paper describes a design methodology for an object oriented database,basedon a semantic network. This approach is based on the assumption that Yemanticdata models are more p...
Mokrane Bouzeghoub, Elisabeth Métais