583 search results - page 50 / 117 » Efficient algorithms for constructing decision trees with co... |
IJCAI
2007
14 years 11 months ago
2007
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 ...
AUSAI
1999
Springer
15 years 2 months ago
1999
Springer
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,...
SWAT
2000
Springer
15 years 1 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
103
click to vote
ANOR
2007
14 years 10 months ago
2007
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...