Fast and accurate cross-correlation over arbitrary time lags. Moved to:

Fast and accurate cross-correlation over arbitrary time lags.

This is a variation of the classical river crossing puzzle. In these kinds of puzzles, the limitations to the solution is defined by the constraints placed on the different objects involved.

Educational ransomware leak site simulator with multi-language support, victim chat system, and admin dashboard for security awareness training

All AUT's principles and applications of artificial intelligence course projects.

Scrape Sri Lanka lottery results from NLB and DLB websites with this Python package

use A*, IDS and BFS to sort colored cards in ascending order.

AI class's project

A Python script to visually compare the performance of Breadth-First Search (BFS), Depth-Limited Search (DLS), and Iterative Deepening Search (IDS) graph algorithms using matplotlib.

Sokoban game using algorithm searching

This repository implements the Duckworth-Lewis method for ODI cricket matches, modeling run production using mathematical formulations and optimizing parameters for predictive accuracy. It includes data cleaning, analysis, visualization, and results on scoring dynamics.

Implementation and comparison of some uninformed search algorithms 🔎🗺️🌏

example route configurations for the Taskinity DSL. Each example demonstrates different routing scenarios and features.

A Digital Logic Sim CE save-file-writer

Solving River Crossing Problem using Depth-Limited-Search algorithm in python.

Итоговый проект. Реализация модели детекции и ее встраивание в реальное приложение на python

Implementation Classical Search Algorithms as project for AI Fall 2018