145 search results - page 15 / 29 » On finding approximate optimal paths in weighted regions |
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
SIAMJO
2002
13 years 7 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--This paper analyzes the outage probability in cognitive radio networks, based on the Poisson point process model of node spatial distribution and the standard propagation...
JAIR
2008
13 years 7 months ago
2008
In this article we consider the issue of optimal control in collaborative multi-agent systems with stochastic dynamics. The agents have a joint task in which they have to reach a ...
SIAMCOMP
2008
13 years 7 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...