91 search results - page 4 / 19 » Finding an Optimal Path without Growing the Tree |
TON
2002
13 years 7 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
AAAI
2000
13 years 9 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a new method called Transition-based RRT (T-RRT) for path planning problems in continuous cost spaces. It combines the exploration strength of the RRT algorith...
ICRA
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper presents a new needle path planning method for digital breast tomosynthesis biopsy. Needle insertion planning into deformable tissue for breast biopsy procedure is a cha...