Results 11 to 20 of about 134 (105)

Pony: Leveraging m-Graphs and Pruned-BFS Algorithm to Elevate AI-Powered Low-Cost Self-Driving Robotics

IEEE Access
In industrial environments, efficient indoor transportation is a cornerstone of streamlined operations. However, the availability of high-end robotic transportation systems often poses a challenge for small-scale manufacturers due to their prohibitive ...
Samarth Godara, Geeta Sikka, Rajender Parsad, Sudeep Marwaha, Mukhtar Ahmad Faiz, Ram Swaroop Bana   +5 more
doaj   +2 more sources

Fast Parallel Graph-Search with Splittable and Catenable Frontiers [PDF]

, 2015
With the increasing processing power of multicore computers, parallel graph search (or graph traversal) using shared memory machines has become increasingly feasible and important.
Rainey, Mike, Acar, Umut A., Charguéraud, Arthur   +2 more
core   +4 more sources

Reachability in High Treewidth Graphs [PDF]

, 2019
Reachability is the problem of deciding whether there is a path from one vertex to the other in the graph. Standard graph traversal algorithms such as DFS and BFS take linear time to decide reachability; however, their space complexity is also linear. On
Jain, Rahul, Tewari, Raghunath
core   +1 more source

GraphOS: Towards Oblivious Graph Processing

, 2023
We propose GraphOS, a system that allows a client that owns a graph database to outsource it to an untrusted server for storage and querying. It relies on doubly-oblivious primitives and trusted hardware to achieve a very strong privacy and efficiency ...
Chamani, Javad Ghareh, Papamanthou, Charalampos, Demertzis, Ioannis, Papadopoulos, Dimitrios, Jalili, Rasool   +4 more
core   +1 more source

Dispersion of mobile robots using global communication

, 2022
The dispersion problem on graphs asks k≤n robots placed initially arbitrarily on the nodes of an n-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a distinct node of the graph.
Molla, Anisur Rahaman, Sharma, Gokarna, Kshemkalyani, Ajay D.   +2 more
core   +1 more source

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

, 2017
peer reviewedGraph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying.
CHANGAIVAL, Boonyarit, Lavangnananda, Kittichai, Kittichai Lavangnananda, Pascal Bouvry, Martin Rosalie, ROSALIE, Martin, Grégoire Danoy, BOUVRY, Pascal, DANOY, Grégoire, Boonyarit Changaival   +9 more
core   +1 more source

Fuzzy Multipath Routing Protocol With Intelligent CH Selection and Multipath Routing in WSN

Journal of Computer Networks and Communications, Volume 2026, Issue 1, 2026.
Cluster‐based routing in wireless sensor networks (WSNs) remains constrained by rapid energy depletion of cluster heads (CHs), unstable multihop links, and unbalanced traffic forwarding toward the sink. This article proposes a fuzzy multipath routing (FMR) protocol that jointly improves CH election and intercluster forwarding reliability.
Ahmad Abuashour, Shikha Binwal
wiley   +1 more source

Self‐Healing AI‐Based Protection and Service Restoration Using Multiagent Reinforcement Learning

Journal of Electrical and Computer Engineering, Volume 2026, Issue 1, 2026.
This paper proposes a multiagent reinforcement learning (MARL) framework that unifies fault isolation and service restoration into a single cooperative self‐healing process for active distribution networks. Each intelligent electronic device (IED) at a relay location is modeled as an autonomous agent trained via multiagent proximal policy optimization (
Aamir Nawaz, Aftab Ahmed Almani, Zahid Javid, William Holderbaum, Pramita Mishra   +4 more
wiley   +1 more source

Structure‐Aware Representation Learning for Effective Performance Prediction

Concurrency and Computation: Practice and Experience, Volume 37, Issue 9-11, 15 May 2025.
ABSTRACT Application performance is a function of several unknowns stemming from the interactions between the application, runtime, OS, and underlying hardware, making it challenging to model performance using deep learning techniques, especially without a large labeled dataset. Collecting such labeled longitudinal datasets can take weeks. Intuitively,
Tarek Ramadan, Nathan Pinnow, Chase Phelps, Jayaraman J. Thiagarajan, Tanzima Z. Islam   +4 more
wiley   +1 more source

A Two‐Tier Architecture for Optimizing Traffic Flow Based on Edmonds–Karp Algorithm in Vehicular Ad‐Hoc Networks

Security and Communication Networks, Volume 2025, Issue 1, 2025.
Efficient traffic management in large metropolitan cities has become an increasingly challenging task due to the exponential rise in transportation demands. The optimization of traffic flow in vehicular ad‐hoc networks (VANETs) to minimize congestion and delays remains an important research area.
Bassma Aldahlan, Vincenzo Conti
wiley   +1 more source