2233 search results - page 240 / 447 » On the Complexity of Theory Curbing |
193
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
158
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
152
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same alg...
168
click to vote
AAAI
2010
15 years 8 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
173
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
The paper is devoted to the investigation of imprecision indices, introduced in [7]. They are used for evaluation of uncertainty (or more exactly imprecision), which is contained ...