The present paper examines the task of minimum cost flow finding in a fuzzy dynamic network with lower flow bounds. The distinguishing feature of this problem statement lies in the fuzzy nature of the network parameters, such as flow bounds, transmission costs and transit times. The arcs of the considered network have lower bounds. Another feature of this task is that fuzzy flow bounds, costs a...

Some multicast applications require high bandwidth and bounded delay eg Video conferencing The general problem of constructing bounded delay minimal cost mul ticast trees uses two link metrics cost and delay and is NP complete A number of heuristics have been developed most of which tend to have a high order of time com plexity Our heuristics achieve good results with low time complexity and we...

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topology, such as a wireless network with mobile nodes. The protocol is called Topology Broadcast based on Reverse Path Forwarding (TBRPF), and uses the concept of reverse-path forwarding (RPF) to broadcast link-state upd...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...

Fabrication of an integrated circuit with smaller area, besides reducing the cost of manufacturing, usually causes a reduction in the power dissipation and propagation delay. Using the static CMOS technology to fabricate a circuit that realizes a specific logic function and occupies a minimum space, it must be implemented with continuous diffusion runs. Therefore, at the design stage, an Euleri...

Fabrication of an integrated circuit with smaller area, besides reducing the cost of manufacturing, usually causes a reduction in the power dissipation and propagation delay. Using the static CMOS technology to fabricate a circuit that realizes a specific logic function and occupies a minimum space, it must be implemented with continuous diffusion runs. Therefore, at the design stage, an Euleri...

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given quality-of-service constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a nearoptimal solution. However, these heuristics eith...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...