Sciweavers

1275 search results - page 105 / 255
» Chunking with Decision Trees
Sort
View
CADE
2001
Springer
14 years 2 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
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...
Aart Middeldorp
ECAI
2004
Springer
14 years 3 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
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...
Kenneth N. Brown, James Little, Páidí...
ICML
2005
IEEE
14 years 11 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...
CBMS
2006
IEEE
14 years 4 months ago
Telederm: Enhancing Dermatological Diagnosis for Rural and Remote Communities
This paper describes techniques used in a Web-based decision support system to enhance dermatological diagnosis for rural and remote communities. We proposed a technique to improv...
Monica H. Ou, Geoff A. W. West, Mihai Lazarescu, C...
DKE
2007
136views more  DKE 2007»
13 years 10 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda