Sciweavers

532 search results - page 42 / 107
» Tree exploration with advice
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
IJAIT
2002
82views more  IJAIT 2002»
13 years 7 months ago
Interleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
Youssef Hamadi
AIRS
2008
Springer
14 years 2 months ago
Study of Kernel-Based Methods for Chinese Relation Extraction
Abstract. In this paper, we mainly explore the effectiveness of two kernelbased methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation e...
Ruihong Huang, Le Sun, Yuanyong Feng
ACL
2006
13 years 9 months ago
A Composite Kernel to Extract Relations between Entities with Both Flat and Structured Features
This paper proposes a novel composite kernel for relation extraction. The composite kernel consists of two individual kernels: an entity kernel that allows for entity-related feat...
Min Zhang, Jie Zhang, Jian Su, Guodong Zhou
PR
2006
132views more  PR 2006»
13 years 7 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...