Sciweavers

16430 search results - page 66 / 3286
» On Computable Tree Functions
Sort
View
CG
2006
Springer
14 years 1 days ago
Feature Construction for Reinforcement Learning in Hearts
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
Nathan R. Sturtevant, Adam M. White
ISMB
1998
13 years 11 months ago
Phylogenetic Inference in Protein Superfamilies: Analysis of SH2 Domains
This workfocuses on the inference of evolutionary relationships in protein superfamilies, and the uses of these relationships to identify keypositions in the structure, to infer a...
Kimmen Sjölander
IJCAI
1993
13 years 11 months ago
Rule-Based Regression
While decision trees have been used primarily for classification, they can also model regression or function approximation. Like classification trees, regression trees often yield...
Sholom M. Weiss, Nitin Indurkhya
AAAI
2011
12 years 10 months ago
Optimal Rewards versus Leaf-Evaluation Heuristics in Planning Agents
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis
STACS
1999
Springer
14 years 2 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin