The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...