138 search results - page 3 / 28 » Finding an optimal tree searching strategy in linear time |
ESA
1998
Springer
14 years 2 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
AIIDE
2008
14 years 20 days ago
2008
We present a domain independent off-line adaptation technique called Stochastic Plan Optimization for finding and improving plans in real-time strategy games. Our method is based ...
CP
2009
Springer
14 years 11 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
PKDD
2000
Springer
14 years 1 months ago
2000
Springer
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
GECCO
2009
Springer
14 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...