106 search results - page 5 / 22 » Trees with exponentially growing costs |
OPODIS
2007
13 years 9 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
AAAI
1996
13 years 8 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
EPIA
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
SIAMMAX
2010
13 years 2 months ago
2010
The numerical solution of linear systems with certain tensor product structures is considered. Such structures arise, for example, from the finite element discretization of a line...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...