In this paper, we present a minimum-path mapping algorithm based on genetic algorithm that automatically maps IP cores onto 2D mesh Network on Chip (NoC) architecture. Our algorithm consists of node ...

This repository contains Java implementations of two fundamental graph algorithms: Kruskal's algorithm for finding the minimum spanning tree (MST) and Dijkstra's algorithm for finding the shortest ...

The original minimum exposure path (MEP) problem in wireless sensor networks (WSN) does not take into account the actual constraint conditions of the path. This paper proposes a new MEP problem which ...

Methods: This paper presents an enhanced SMA (ESMA) path-planning algorithm for mobile robots. The ESMA algorithm incorporates adaptive techniques to enhance global search capabilities and integrates ...

Evolution has led to natural algorithms that regulate collective behavior in many biological systems. Here, we investigate natural algorithms that solve the shortest path problem, a basic optimization ...

// One thing to notice here for optimal/a good approach is that if by chance our top element is the target cell then we will //return the effort used till that path. We will not go for further ...

We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m1+o (1) time. Our ...

Machine learning algorithms reshape how robots navigate through complex and dynamic environments, robotic path planning is one such area, the conventional approaches work in a controlled environment, ...