Sciweavers

1453 search results - page 78 / 291
» Partial Constraint Satisfaction
Sort
View
CP
2001
Springer
15 years 8 months ago
Optimal Pruning in Parametric Differential Equations
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
AAAI
1997
15 years 5 months ago
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...
Daya Ram Gaur, W. Ken Jackson, William S. Havens
ATAL
2010
Springer
15 years 5 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
JETAI
2008
93views more  JETAI 2008»
15 years 4 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
DEXA
2004
Springer
131views Database» more  DEXA 2004»
15 years 9 months ago
Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
Sylvain Lagrue, Rodolphe Devillers, Jean-Yves Besq...