J 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

Neural Network World/IDG, 2003, 0169-4243

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Czech Republic

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

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
Změněno: 25/5/2004 15:54, 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. 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 project
Name: Pokročilé plánování a rozvrhování
Investor: Czech Science Foundation, Advanced Planning and Scheduling