This paper presents a low-cost and highperformance programmable digital finite impulse response (FIR) filter. The architecture employs the computation sharing algorithm to reduce the computation complexity. In the traditional computation sharing algorithm, critical path constraint on the output summation stage is a bottleneck, thus, the canonic-sign-digit representation is utilized for filter c...

Shortest path computation is one of the most fundamental operations for managing and analyzing large social networks. Though existing techniques are quite effective for finding the shortest path on large but sparse road networks, social graphs have quite different characteristics: they are generally non-spatial, non-weighted, scale-free, and they exhibit small-world properties in addition to th...

Mobile ad hoc networks support multi hop routing where the deployment of central base station is neither economic nor easy. Efficient routing of the packets is a major challenge in the ad hoc networks. There exist several proactive (like DSDV etc.) and reactive (Like AODV etc.) routing algorithms for the dynamic networks.The EEAODV ALGORITHM selects the path with minimum cost value indicating t...

Most work in heuristic search focused on path finding problems in which the cost of a path in the state space is the sum of its edges’ weights. This paper addresses a different class of path finding problems in which the cost of a path is the product of its weights. We present reductions from different classes of multiplicative path finding problems to suitable classes of additive path finding ...

Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network (ISPN) that handles requests with QoS requirements. While heuristics for determining paths for such requests have been formulated for a variety of QoS models, little attention has been given to the overall processing ...

This study addresses the flight-path planning problem for multirotor aerial vehicles (AVs). We consider the specific features and requirements of real-time flight-path planning and develop a rapidly-exploring random tree (RRT) algorithm to determine a preliminary flight path in three-dimensional space. Since the path obtained by the RRT may not be optimal due to the existence of redundant waypo...

"Satisfying customers' traffic engineering connection requests is one of the biggest challenges of today's service providers. However, routing mechanisms which only consider service level specifications as the path selection criteria may not be aware of energy consumption and Co2 emission rate of the routed paths. This can generate huge Co2 emissions and consume energy inefficiently. This paper...

In this paper, we study the online path planning for khepera II mobile robot in an unknown environment. The well known heuristic A* algorithm is implemented to make the mobile robot navigate through static obstacles and find the shortest path from an initial position to a target position by avoiding the obstacles. The proposed path finding strategy is designed in a grid-map form of an unknown e...

The Delay Constrained Least Cost (DCLC) problem is to find the least cost path in a graph while keeping the path delay below a specified value. First formulated in the context of routing in computer networks, the DCLC model also applies to mission planning and other decision problems. DCLC is NP-complete and therefore many heuristic algorithms have been proposed for it. This paper presents two ...

A procedure commonly used in Job Shop Scheduling Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. T...