137 search results - page 17 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
ENGL
2007
13 years 7 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
SMC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract— Wireless networked control systems have begun to gain acceptance during the last decade, largely due to the increased flexibility and lower costs they promise to provi...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
MOBICOM
2003
ACM
14 years 18 days ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...