6693 search results - page 5 / 1339 » On an anytime algorithm for control |
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
PRICAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
UAI
1998
13 years 9 months ago
1998
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...
ECSQARU
2001
Springer
14 years 10 days ago
2001
Springer
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...