Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
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...
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
This paper describes a new FPGA implementation of a system for evolutionary image filter design. Three parallel search algorithms are compared. An optimal mutation rate and the q...
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...