Minimal Perturbation Problem - A Formal View
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F03%3A00008700" target="_blank" >RIV/00216224:14330/03:00008700 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Minimal Perturbation Problem - A Formal View
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F01%2F0942" target="_blank" >GA201/01/0942: Advanced Planning and Scheduling</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of ERCIM Working Group on Constraints/CompulogNet Area on "Constraint Programming" Workshop
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
18
Pages from-to
209
Publisher name
MTA SZTAKI
Place of publication
Budapest (Hungary)
Event location
Budapest (Hungary)
Event date
Jun 30, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—