707 search results - page 37 / 142 » Solving path problems on the GPU |
102
click to vote
COMPGEOM
1990
ACM
15 years 3 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
117
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
132
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...