Sciweavers

2492 search results - page 177 / 499
» On the General Signature Trees
Sort
View
AMAI
1999
Springer
15 years 6 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
ICFP
2007
ACM
16 years 6 months ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring
AAAI
2010
15 years 8 months ago
Reinforcement Learning via AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
SAC
2009
ACM
16 years 1 months ago
LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
Márcio P. Basgalupp, Rodrigo C. Barros, And...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 21 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith