IEEE

Distributed Predefined-Time Convergent Algorithm for Solving Time-Varying Resource Allocation Problem Over Directed Networks

Abstract: This article introduces an innovative distributed algorithm tailored for achieving predefined-time convergence in addressing time-varying resource allocation problem under directed networks.
IEEE

Solving Human–Robot Collaborative Circular Disassembly Line Balancing Problem via Graph Neural Network-Enhanced Proximal Policy Optimization Algorithm

Abstract: Industry 5.0 promotes the transformation of manufacturing toward flexibility, personalization, and sustainability. As a critical component of closed-loop manufacturing systems, disassembly ...
LinkedIn

Bridges and Articulation Points in Java: Complete Guide with Tarjan's Algorithm and LeetCode Solutions

Nodes 0, 1, and 2 form a cycle. If we remove 0 - 1, the graph remains connected. However, removing 1 - 3 disconnects nodes 3 and 4 from the rest of the graph.
GitHub

Solving 0–1 Knapsack Problems Using Sine-Cosine Algorithm

This repository contains code used in the paper, "Solving 0–1 Knapsack Problems Using Sine-Cosine Algorithm". The Sine Cosine Algorithm (SCA), developed by Seyedali Mirjalili [1], belongs to the class ...
LinkedIn

Building a Micromouse Maze Lab: How a Cute Shark Puppet Helped Me Understand Complexity Science, Network Analysis, and Algorithmic Decision-Making

A maze may look static, but the behavior of the mouse changes depending on what it knows, what it senses, what algorithm it uses, and how much uncertainty exists in the system. A full-knowledge ...