Detailed Information on Publication Record
2003
Minimal Perturbation Problem - A Formal View
BARTÁK, Roman, Tomáš MÜLLER and Hana RUDOVÁBasic information
Original name
Minimal Perturbation Problem - A Formal View
Authors
BARTÁK, Roman (203 Czech Republic), Tomáš MÜLLER (203 Czech Republic) and Hana RUDOVÁ (203 Czech Republic, guarantor)
Edition
Budapest (Hungary), Proceedings of ERCIM Working Group on Constraints/CompulogNet Area on "Constraint Programming" Workshop, p. 209-226, 2003
Publisher
MTA SZTAKI
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Hungary
Confidentiality degree
není předmětem státního či obchodního tajemství
References:
RIV identification code
RIV/00216224:14330/03:00008700
Organization unit
Faculty of Informatics
Keywords in English
constraint satisfaction; solution update; timetabling
Změněno: 24/5/2004 17:00, doc. Mgr. Hana Rudová, Ph.D.
Abstract
V originále
Formulation of many real-life problems evolves as the problem is being solved. These changes are typically initiated by a user intervention or by changes in the environment. However, the traditional formulation of the constraint satisfaction problem is static in the sense that it must be fully specified before the solving process starts. We propose a formal description of so called minimal perturbation problem that allows an automated modification of the (partial) solution when the problem formulation changes. We also discuss a first proposal of the algorithm for solving such type of problems.
Links
| GA201/01/0942, research and development project |
|