1661 search results - page 126 / 333 » Decision Tree Fields |
181
click to vote
JVA
2006
IEEE
16 years 12 days ago
2006
IEEE
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
169
click to vote
CADE
2001
Springer
15 years 11 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
146
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
161
click to vote
APVIS
2004
15 years 7 months ago
2004
The development of powerful visualisation tools is a major challenge in bioinformatics. Phylogenetics, a field with a growing impact on a variety of life science areas, is experie...
188
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...