Results 1  10
of
10,433
Uncertainty in dynamic constraint satisfaction problems
"... Abstract. Many real life problems that can be modeled as Constraint Satisfaction Problems (CSPs) come from uncertain and dynamic environments, so the original solution found might become invalid after changes. Here, we study the problem of finding robust solutions for CSPs under the assumptions tha ..."
Abstract
 Add to MetaCart
Abstract. Many real life problems that can be modeled as Constraint Satisfaction Problems (CSPs) come from uncertain and dynamic environments, so the original solution found might become invalid after changes. Here, we study the problem of finding robust solutions for CSPs under the assumptions
Nogood Recording for Static and Dynamic Constraint Satisfaction Problems
 International Journal of Artificial Intelligence Tools
, 1993
"... Many AI synthesis problems such as planning, scheduling or design may be encoded in a constraint satisfaction problem (CSP). A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all given constraints between these variables. However, fo ..."
Abstract

Cited by 120 (5 self)
 Add to MetaCart
that may be used for solving both static and dynamic CSPs. It offers an interesting compromise, polynomially bounded in space, between an ATMSlike approach and the usual static constraint satisfaction algorithms. 1 Introduction The constraint satisfaction problem (CSP) model is widely used to represent
Solution reuse in dynamic constraint satisfaction problems
 In Proceedings of the 12th National Conference on Artificial Intelligence
, 1994
"... Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environment, the user or other agents in the framework of a distributed system. In this context, computing a new solution from s ..."
Abstract

Cited by 96 (6 self)
 Add to MetaCart
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environment, the user or other agents in the framework of a distributed system. In this context, computing a new solution from
Arc consistency in dynamic constraint satisfaction problems
 In Proceedings AAAI'91
, 1991
"... Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NPcomplete task, many filtering techniques have been developed for CSPs. The most used filtering techniques are those achieving arcconsiste ..."
Abstract

Cited by 95 (3 self)
 Add to MetaCart
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NPcomplete task, many filtering techniques have been developed for CSPs. The most used filtering techniques are those achieving arc
Dynamic Backtracking for Dynamic Constraint Satisfaction Problems
 In Proceedings of the ECAI94 Workshop on Constraint Satisfaction Issues Raised by Practical Applications
, 1994
"... Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environment, the user or the other agents in the framework of a distributed system. The notion of dynamic CSP (DCSP) has been in ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environment, the user or the other agents in the framework of a distributed system. The notion of dynamic CSP (DCSP) has been
Stable Solutions for Dynamic Constraint Satisfaction Problems
, 1998
"... . An important extension of constraint technology involves problems that undergo changes that may invalidate the current solution. Previous work on dynamic problems sought methods for efficiently finding new solutions. We take a more proactive approach, exploring methods for finding solutions mo ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
. An important extension of constraint technology involves problems that undergo changes that may invalidate the current solution. Previous work on dynamic problems sought methods for efficiently finding new solutions. We take a more proactive approach, exploring methods for finding solutions
Grid Workflow Recovery as Dynamic Constraint Satisfaction Problem
"... Abstract—With service level agreements (SLAs) the Grid broker guarantees to finish the Grid jobs by a given deadline. There are a number of approaches, to plan reservations to fulfil these deadline requirements and to handle currently running jobs in the case of a resource failure. However, there is ..."
Abstract
 Add to MetaCart
to determine a remapping saving as much Grid jobs as possible. In this paper a recovery scheme for Grid workflows using a dynamic constraint solver is presented and the gain in the number of saved Grid jobs is evaluated using extensive simulations. I.
An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems
 In International Florida AI Research Society Conference
, 2005
"... Real world is dynamic in its nature, so techniques attempting to model the real world should take this dynamicity in consideration. A well known Constraint Satisfaction Problem (CSP) can be extended this way to a so called Dynamic Constraint Satisfaction Problem (DynCSP) that supports adding and rem ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Real world is dynamic in its nature, so techniques attempting to model the real world should take this dynamicity in consideration. A well known Constraint Satisfaction Problem (CSP) can be extended this way to a so called Dynamic Constraint Satisfaction Problem (DynCSP) that supports adding
Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features
, 2009
"... This paper presents a new analysis of dynamic constraint satisfaction problems (DCSPs) with finite domans and a new approach to solving them. We first show that even very small changes in a CSP, in the form of addition of constraints or changes in constraint relations, can have profound effects on s ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper presents a new analysis of dynamic constraint satisfaction problems (DCSPs) with finite domans and a new approach to solving them. We first show that even very small changes in a CSP, in the form of addition of constraints or changes in constraint relations, can have profound effects
Two Approaches to the Solution Maintenance Problem in Dynamic Constraint Satisfaction Problems
 In Proceedings of the IJCAI93/SIGMAN Workshop on Knowledgebased Production Planning, Scheduling and Control
, 1993
"... Many AI synthesis problems such as planning or scheduling may be modelized as constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all given constraints between these variables. However, for many ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Many AI synthesis problems such as planning or scheduling may be modelized as constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all given constraints between these variables. However, for many
Results 1  10
of
10,433