2796 search results - page 271 / 560 » The coolest path problem |
145
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
164
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
287
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
177
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. I...
160
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...