IEEE

Obtaining the Dominating Set in Graphs with the Invasive Weed Optimization Algorithm

Abstract: The minimum dominant set problem in graphs is a well-known NP-hard problem that requires the use of heuristics to obtain approximate solutions due to its computational complexity. Among the ...
GitHub

Python Maze Solver using A* Algorithm with Movement Constraints

A Python script with an AI algorithm that solves a 2D maze using the A* search algorithm - but, with specific movement constraints, to really force the AI earn its way out of the maze. This time, ...
IEEE

Usage of Markov Metric in Decoding of Convolutional Codes in Two-State Channels

Abstract: The article discusses the data transmission using convolutional codes over channels where the noise process can be described by a Markov chain with two ...
Frontiers

Density peak clustering algorithm based on weighted mutual K-nearest neighbors

1 School of Computer Science and Technology, Yibin University, Yibin, China 2 School of Computer and Software, Southwest Petroleum University, Chengdu, China Ever since Density Peak Clustering (DPC) ...
GitHub

LLM4AD: Large Language Model for Algorithm Design

LLM4AD is an open-source Python-based Platform leveraging Large Language Models (LLMs) for Automatic Algorithm Design (AD). Please refer to the paper [LLM4AD] for detailed information, including the ...