2002
Limited Assignment Number Search Algorithm
VEŘMIŘOVSKÝ, Kamil and Hana RUDOVÁBasic information
Original name
Limited Assignment Number Search Algorithm
Authors
VEŘMIŘOVSKÝ, Kamil and Hana RUDOVÁ
Edition
Milovy (CZ), SOFSEM 2002 Student Research Forum, p. 53-58, 2002
Publisher
Neuveden
Other information
Language
English
Type of outcome
Proceedings paper
Field of Study
20200 2.2 Electrical engineering, Electronic engineering, Information engineering
Country of publisher
Czech Republic
Confidentiality degree
is not subject to a state or trade secret
References:
RIV identification code
RIV/00216224:14330/02:00007807
Organization unit
Faculty of Informatics
Keywords in English
search algorithm; constraint satisfaction; constraint logic programming
Changed: 21/5/2003 21:31, doc. Mgr. Hana Rudová, Ph.D.
Abstract
In the original language
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.
Links
| GA201/01/0942, research and development project |
|