BARTÁK, Roman, Tomáš MÜLLER and Hana RUDOVÁ. Minimal Perturbation Problem - A Formal View. Neural Network World/IDG. 2003, vol. 3, No 5, p. 501-511. ISSN 0169-4243.
Other formats:   BibTeX LaTeX RIS
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 Neural Network World/IDG, 2003, 0169-4243.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Czech Republic
Confidentiality degree is not subject to a state or trade secret
WWW URL
Impact factor Impact factor: 0.822
RIV identification code RIV/00216224:14330/03:00008705
Organization unit Faculty of Informatics
Keywords in English constraint satisfaction; solution update; soft constraints; timetabling
Tags constraint satisfaction, soft constraints, solution update, timetabling
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 25/5/2004 15:54.
Abstract
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. In this paper, 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. Our model is defined for constraint satisfaction problems with emphasis put on finding a solution anytime even for over-constrained problems.
Links
GA201/01/0942, research and development projectName: Pokročilé plánování a rozvrhování
Investor: Czech Science Foundation, Advanced Planning and Scheduling
PrintDisplayed: 27/5/2024 19:36