310 search results - page 5 / 62 » A General Technique for Plan Repair |
FLAIRS
2004
13 years 8 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
SETN
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
ARTMED
1999
13 years 7 months ago
1999
In this paper, we describe how user-adapted explanations about drug prescriptions can be generated from already existing data sources. We start by illustrating the two-step approa...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...