2168 search results - page 427 / 434 » Randomized Algorithms and Complexity Theory |
193
click to vote
CP
2009
Springer
16 years 6 days ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
166
click to vote
PODS
2009
ACM
16 years 3 days ago
2009
ACM
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
181
click to vote
POPL
2006
ACM
15 years 12 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
SOSP
2005
ACM
15 years 8 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
104
click to vote
EDBT
2010
ACM
15 years 6 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...