3223 search results - page 532 / 645 » The Scaling of Search Cost |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Meta-level control manages the allocation of limited resources to deliberative actions. This paper discusses efforts in adding meta-level control capabilities to a Markov Decision...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...
CC
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Finding opinionated blog posts is still an open problem in information retrieval, as exemplified by the recent TREC blog tracks. Most of the current solutions involve the use of e...