Sciweavers

1661 search results - page 119 / 333
» Decision Tree Fields
Sort
View
MFCS
2004
Springer
15 years 11 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
IJCAI
2007
15 years 7 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
RP
2010
Springer
163views Control Systems» more  RP 2010»
15 years 4 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
CSMR
2000
IEEE
15 years 10 months ago
The Evolution Tree: A Maintenance-Oriented Software Development Model
In this paper we introduce the evolution tree - a software life-cycle model that describes software development as the continuous evolution of a software product. That is, we view...
Amir Tomer, Stephen R. Schach
AUSAI
1999
Springer
15 years 10 months ago
Generating Rule Sets from Model Trees
Model trees—decision trees with linear models at the leaf nodes—have recently emerged as an accurate method for numeric prediction that produces understandable models. However,...
Geoffrey Holmes, Mark Hall, Eibe Frank