1772 search results - page 189 / 355 » Classifying Problems into Complexity Classes |
93
Voted
AIPS
2007
15 years 3 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
86
Voted
UAI
1997
15 years 2 months ago
1997
We review the problem of time-critical action and discuss a reformulation that shifts knowledge acquisition from the assessment of complex temporal probabilistic dependencies to t...
108
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
120
click to vote
KDD
2002
ACM
16 years 1 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
117
Voted
PCM
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper, we investigate the problem of classifying a subset of environmental sounds in movie audio tracks that indicate specific indexical semiotic use. These envi...