Sciweavers

980 search results - page 165 / 196
» Decentralized Constraint Satisfaction
Sort
View
IJIIDS
2010
115views more  IJIIDS 2010»
13 years 7 months ago
Towards the preservation of functional dependency in XML data transformation
With the advent of XML as a data representation and exchange format over the web, a massive amount of data is being stored in XML. The task of data transformation for integration ...
Md. Sumon Shahriar, Jixue Liu
TALG
2010
110views more  TALG 2010»
13 years 7 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
CPAIOR
2010
Springer
13 years 7 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
SIGMOD
2011
ACM
169views Database» more  SIGMOD 2011»
12 years 11 months ago
Coordination through querying in the youtopia system
In a previous paper, we laid out the vision of declarative datadriven coordination (D3C) where users are provided with novel abstractions that enable them to communicate and coord...
Nitin Gupta 0003, Lucja Kot, Gabriel Bender, Sudip...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur