Informace o publikaci
Limited Assignment Number Search Algorithm
| Autoři | |
|---|---|
| Rok publikování | 2002 |
| Druh | Článek ve sborníku |
| Konference | SOFSEM 2002 Student Research Forum |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | |
| Obor | Využití počítačů, robotika a její aplikace |
| Klíčová slova | search algorithm; constraint satisfaction; constraint logic programming |
| Popis | A nonsystematic iterative search algorithm for hard or over-constrained problems is proposed. This linear time complexity algorithm seeks a (partial) assignment of the problem variables. One step of the algorithm is a special incomplete version of chronological backtracking with constraint propagation. Subsequent searches try to improve the last computed partial assignment. This is done by developing variable and value heuristics based on the results of previous iterations. The algorithm was applied to solve random problems and a large scale timetabling problem from Purdue University. |
| Související projekty: |