Sciweavers

391 search results - page 35 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
CP
2008
Springer
13 years 9 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
ECSQARU
2005
Springer
14 years 1 months ago
A Local Fusion Method of Temporal Information
Information often comes from different sources and merging these sources usually leads to apparition of inconsistencies. Fusion is the operation which consists in restoring the co...
Mahat Khelfallah, Belaid Benhamou
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
PVLDB
2008
90views more  PVLDB 2008»
13 years 7 months ago
Generating XML structure using examples and constraints
This paper presents a framework for automatically generating structural XML documents. The user provides a target DTD and an example of an XML document, called a Generate-XML-ByEx...
Sara Cohen
EDBTW
2004
Springer
14 years 1 months ago
Query Answering in Peer-to-Peer Data Exchange Systems
The problem of answering queries posed to a peer who is a member of a peer-to-peerdataexchangesystemisstudied.Theanswershavetobeconsistentwrt to both the local semantic constraints...
Leopoldo E. Bertossi, Loreto Bravo