Other formats:
BibTeX
LaTeX
RIS
@inproceedings{486783, author = {Veřmiřovský, Kamil and Rudová, Hana}, address = {Milovy (CZ)}, booktitle = {SOFSEM 2002 Student Research Forum}, keywords = {search algorithm; constraint satisfaction; constraint logic programming}, language = {eng}, location = {Milovy (CZ)}, pages = {53-58}, publisher = {Neuveden}, title = {Limited Assignment Number Search Algorithm}, url = {http://www.fi.muni.cz/~hanka/publ/sofsem02.pdf}, year = {2002} }
TY - JOUR ID - 486783 AU - Veřmiřovský, Kamil - Rudová, Hana PY - 2002 TI - Limited Assignment Number Search Algorithm PB - Neuveden CY - Milovy (CZ) KW - search algorithm KW - constraint satisfaction KW - constraint logic programming UR - http://www.fi.muni.cz/~hanka/publ/sofsem02.pdf N2 - 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. ER -
VEŘMIŘOVSKÝ, Kamil and Hana RUDOVÁ. Limited Assignment Number Search Algorithm. In \textit{SOFSEM 2002 Student Research Forum}. Milovy (CZ): Neuveden, 2002, p.~53-58.
|