Abstract: In compile-time task scheduling for distributed-memory systems, list scheduling is generally accepted as an attractive approach, since it pairs low cost with good results. List-scheduling ...

Unit drop and rally at clicked on location is done, with local crowd pushaway implemented at instantiation. Potential field map approach is implemented and used depending on the number of units and ...

With excellent maneuverability, low operating costs and flexible deployment capabilities, UAVs have demonstrated significant application value in areas such as environmental monitoring, disaster ...

A* (or AStar) is a graph search algorithm widely used in artificial intelligence. While the traditional version of this algorithm is purely sequential, there have been several parallel versions over ...

Forest fires are the source of countless fatalities and extreme economic repercussions. The safe evacuation of residents of an area affected by forest fires is the highest priority of local ...

Abstract: This paper explores two types of search algorithms: uninformed search and informed search. Both these types are discussed into detail and some of the specific algorithms, that is, Breadth ...

In the ever-evolving field of computer science, the ability to compare algorithms is not just a skill but a necessity. Algorithms are the backbone of any computational process, dictating how data is ...

Solving the sliding puzzle using a basic AI algorithm. I had published this article on Medium in September of 2018. I have decided to create more content on my LinkedIn profile, thus rewriting this ...

1 Mathematics Department, Faculty of Science, Al-Azhar University, Cairo, Egypt. 2 Mathematics Department, Faculty of Applied Medical Science, Taif University, Turabah, KSA. The shortest path problem ...