829 search results - page 155 / 166 » Bandit Algorithms for Tree Search |
AIPS
2009
13 years 9 months ago
2009
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...
SIGIR
2010
ACM
13 years 8 months ago
2010
ACM
In this poster, we propose a novel document summarization approach named Ontology-enriched M ulti-Document Summarization(OMS) for utilizing background knowledge to improve summari...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...