Minimal Perturbation Problem - A Formal View

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F03%3A00008705" target="_blank" >RIV/00216224:14330/03:00008705 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

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. In this paper, we propose a formal description of so called minimal perturbationproblem 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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

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)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Neural Network World/IDG

ISSN

0169-4243

e-ISSN

—

Volume of the periodical

3

Issue of the periodical within the volume

5

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

11

Pages from-to

501

UT code for WoS article

—

EID of the result in the Scopus database

—