This chapter examines optimal path finding problems with direction, location and time dependent environments. The dependence of the cost function and path constraints on the location of the mobile agent and time creates the need for a dynamic navigation algorithm, capable of adjusting the path in real-time as more information about the environment becomes available. In addition, the direction-d...

The application of neural networks to the optimum routing problem in packet-switched computer networks, where the goal is to minimize the network-wide average time delay, is addressed. Under appropriate assumptions, the optimum routing algorithm relies heavily on shortest path computations that have to be carried out in real time. For this purpose an efficient neural network shortest path algor...

This paper introduces an efficient technique to compute a tight upper bound for the unate and binate covering problems. It is known that a covering problem can be solved by finding a shortest path on a BDD representing a satisfiability formula. Our technique is based on finding an approximation to the shortest path by identifying a path on a BDD composed of as many negative edges as possible. T...

In the Dasgupta-Heal-Solow-Stiglitz model of capital accumulation and resource depletion we show the following equivalence: If an efficient path has constant (gross and net of population growth) savings rates, then population growth must be quasi-arithmetic and the path is a maximin or a classical utilitarian optimum. Conversely, if a path is optimal according to maximin or classical utilitaria...

We present here a novel framework for graph-based pattern recognition techniques called Optimum-Path Forest (OPF), which has been demonstrated to be superior than traditional supervised pattern recognition techniques, such as Artificial Neural Networks using Multilayer Perceptrons and Support Vector Machines, in terms of both accuracy and execution times. The OPF-based classifiers model the pro...

Owning to the high-speed feed rate and ultra spindle speed have been used in modern machine tools, the tool-path generation plays a key role in the successful application of a High-Speed Machining (HSM) system. Because of its importance in both high-speed machining and tool-path generation, approximating a contour by NURBS format is a potential function in CAD/CAM/CNC systems. It is much more c...

Owning to the high-speed feed rate and ultra spindle speed have been used in modern machine tools, the tool-path generation plays a key role in the successful application of a High-Speed Machining (HSM) system. Because of its importance in both high-speed machining and tool-path generation, approximating a contour by NURBS format is a potential function in CAD/CAM/CNC systems. It is much more c...

Various multistage interconnection networks have been proposed in the literature for the implementation of an ATM switch fabric. However, most of the corresponding performance studies were limited to simple cell level models, ignoring the effect of connection level functions such as path hunting and call acceptance control. This paper aims at a performance comparison of several routing strategi...