549 search results - page 82 / 110 » On the Complexity of Restricted k-anonymity Problem |
108
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
122
click to vote
PODS
2004
ACM
16 years 2 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
134
click to vote
BPM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Business process (BP) modeling is a building block for design and management of business processes. Two fundamental aspects of BP modeling are: a formal framework that we...
105
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
129
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...