Network on chip is an emerging concept for communication within large VLSI systems implemented on a single silicon chip. Routing is an important parameter. The routing algorithm should be implemented by simple logic and number of data buffers should be minimal. So selection of routing algorithm is critical. I am going to propose an adaptive routing technique that increases the effectiveness of ...

Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and cannot be solved in polynomial time. Thus, many proposed source routing algorithms tackle this problem by transforming it into the shortest path problem, which is P-complete, with an integrated cost function that maps multi-constraints into a single cost. However, this approach may fail to find a ...

in present paper, a point to point optimal path is planned for a mobile manipulator with flexible links and joints. for this purpose, a perfect dynamic modeling is performed for mobile manipulators considering large deformation in links, shear effects, elastic joints, effect of gravitation, and non-holonomic constraints. to study large deformation of links, non-linear relation of displacement-s...

Given a spatio-temporal network, a source, a destination, and a start-time interval, the All-start-time Lagrangian Shortest Paths (ALSP) problem determines a path set which includes the shortest path for every start time in the given interval. ALSP is important for critical societal applications related to air travel, road travel, and other spatiotemporal networks. However, ALSP is computationa...

This paper presents an innovative approach to maximally disconnect a given network. More specifically, this work introduces the concept of a critical disruption path, a path between a source and a destination vertex whose deletion minimizes the cardinality of the largest remaining connected component. Network interdiction models seek to optimally disrupt network operations. Existing interdictio...

Various algorithms have been proposed for the determination of the optimum path(s) in line networks. Moving in space under constraints is a far more complex problem, where research has been relatively scarce. An example would be the determination of the shortest sea course between two harbors. This paper presents a graph-based approach to the problem of the optimum path(s) finding in space; and...

For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...

In this paper, we consider a problem of VLSI design occurring in the routing phase. The problem is to determine the optimal size selection for the gates in a combinatorial circuit which uses the problem of finding a shortest path in an oriented acyclic graph for making certain updates between any two successive iterations. For this NP-hard problem, we give an approximation algorithm.