Results 1  10
of
819,667
The Optimal Path Problem
, 1999
"... In this paper, the optimal path problem will be studied from a global point of view and having no restrictions imposed on the network. The concepts of boundness and finiteness will be presented for the general problem and will be studied in two particular cases. Special emphasis will be given to t ..."
Abstract

Cited by 53 (3 self)
 Add to MetaCart
In this paper, the optimal path problem will be studied from a global point of view and having no restrictions imposed on the network. The concepts of boundness and finiteness will be presented for the general problem and will be studied in two particular cases. Special emphasis will be given
Optimal paths for a car that goes both forwards and backwards
 PACIFIC JOURNAL OF MATHEMATICS
, 1990
"... The path taken by a car with a given minimum turning radius has a lower bound on its radius of curvature at each point, but the path has cusps if the car shifts into or out of reverse gear. What is the shortest such path a car can travel between two points if its starting and ending directions are s ..."
Abstract

Cited by 270 (0 self)
 Add to MetaCart
give these paths by explicit formula. Calculating the length of each of these paths and selecting the (not necessarily unique) path with smallest length yields a simple algorithm for a shortest path in each case. These optimal paths or geodesies may be described as follows: If C is an arc of a circle
OPTIMAL PATHS TO RETIREMENT By
"... Mexico has adopted a newly privatized pension system for all workers in the formal sector of the economy. There are 14 retirement funds (AFORES) to choose from. Every worker is allowed to switch from one AFORE to another every year. What is the best path to choose if the worker tries to minimize ser ..."
Abstract
 Add to MetaCart
. The only way to work out the optimal path is to consider all the possible strategies with stochastic interest rates that are correlated over time. In this paper, we propose a method of working out the optimal path to retirement. The results show that under most possible scenarios there is no single best
Statistical Properties of Optimal Paths
"... We study the statistical properties of optimal paths in weighted complex networks with general distribution of weights. We find a general criterion for the strength of disorder and show the relation of optimal paths properties to percolation, in both strong and weak disorder limits. Transport in we ..."
Abstract
 Add to MetaCart
We study the statistical properties of optimal paths in weighted complex networks with general distribution of weights. We find a general criterion for the strength of disorder and show the relation of optimal paths properties to percolation, in both strong and weak disorder limits. Transport
An Algorithm for Ranking Optimal Paths
, 2000
"... : Assuming the existence of an algorithm for computing the optimal loopless path between two given nodes in a network when considering a general cost function, in this paper a deviation algorithm for enumerating K optimal loopless paths is proposed. It is also presented an adaptation of this algorit ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
: Assuming the existence of an algorithm for computing the optimal loopless path between two given nodes in a network when considering a general cost function, in this paper a deviation algorithm for enumerating K optimal loopless paths is proposed. It is also presented an adaptation
Optimal Paths in Weighted Timed Automata
 HSCC
, 2001
"... We consider an optimalreachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to a (parametric) shortestpath problem for a finite directed graph. The directed gr ..."
Abstract

Cited by 121 (5 self)
 Add to MetaCart
We consider an optimalreachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to a (parametric) shortestpath problem for a finite directed graph. The directed
Ubiquitous Fractal Dimension of Optimal Paths
"... The fractal dimension of an optimal path in the strong disorder limit could be a fundamental property of many natural systems. Searching for and characterizing a disordered landscape’s optimal path is an important problem in theoretical and computational physics due to its often intimate association ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The fractal dimension of an optimal path in the strong disorder limit could be a fundamental property of many natural systems. Searching for and characterizing a disordered landscape’s optimal path is an important problem in theoretical and computational physics due to its often intimate
The optimal pathmatching problem
 COMBINATORICA
, 1997
"... We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problemspolynomialtime solvability, minmax theorems, and totally dual integral polyhedral descr ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problemspolynomialtime solvability, minmax theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for the convex hull of matchable sets of a graph, and a polynomialtime algorithm to compute the rank of a certain matrix of indeterminates.
AN OPTIMALPATH APPROACH FOR NEURAL CIRCUIT RECONSTRUCTION
"... An optimalpath approach for neural circuit reconstruction ..."
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1078 (5 self)
 Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination
Results 1  10
of
819,667