314 search results - page 25 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
ACISICIS
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
CP
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. In this paper we consider the problem of optimal task allocation and scheduling in embedded real-time systems. This problem is far from trivial due to the wide range of c...
IRI
2006
IEEE
14 years 1 months ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
AAAI
1994
13 years 9 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
PUK
2001
13 years 9 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...