474 search results - page 26 / 95 » On Multicast Path Finding Algorithms |
IWEC
2008
14 years 11 months ago
2008
Abstract. The selection of path in an urban combat setting determines the survival to a greater extent. In this paper we propose an algorithm that finds strategic paths inside a ma...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
106
click to vote
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
TPDS
1998
14 years 9 months ago
1998
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...