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, ...
Booth School of Business

A Hiring Algorithm That Isn’t Vulnerable to Biased Data

Artificial intelligence has become a popular tool for job recruiters, in part because programmers can code applicant-screening algorithms to avoid any explicit discrimination in their decision-making ...
Scientific Research Publishing

Tan, L. and Guo, K. (2025) Bregman ADMM: A New Algorithm for Nonconvex Optimization with Linear Constraints. Journal of Nonlinear and Variational Analysis, 9, 176-196.

ABSTRACT: The alternating direction method of multipliers (ADMM) and its symmetric version are efficient for minimizing two-block separable problems with linear constraints. However, both ADMM and ...
GitHub

24-backtracking-algorithms.md

Backtracking is a method for solving problems by building candidates for solutions incrementally and abandoning candidates ("backtracking") as soon as it is determined that they cannot lead to a valid ...
C&EN

Historical Retrospect of Aquatic Microbial Communities Based on Water–Carbonate Equilibrium and pH Values in Dianchi Lake Using the Random Forest Algorithm

Key Laboratory of Groundwater Resources and Environment Ministry of Education, Jilin University, Changchun 130021, PR China College of New Energy and Environment, Jilin University, Changchun 130021, ...