3690 search results - page 89 / 738 » Computation with classical sequents |
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
MMB
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
NIPS
2007
14 years 11 months ago
2007
Brain-Computer Interfaces can suffer from a large variance of the subject conditions within and across sessions. For example vigilance fluctuations in the individual, variable ta...
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
14 years 11 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
AIPS
2009
14 years 11 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...