805 search results - page 60 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
143
click to vote
SIGMOD
2008
ACM
15 years 4 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
114
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
142
click to vote
AAAI
1998
15 years 5 months ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
222
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
116
click to vote
ACMICEC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...