An anytime implementation of scikit-learn GridSearchCV

• UpdatedDec 2, 2018
• Python

Julia implementation of RRT* motion planning algorithm.

• UpdatedJun 20, 2022
• Julia

Julia Implementation of Anytime Weighted A* (AWA*) and Randomized Weighted A* (RWA*) algorithm

• UpdatedJun 7, 2022
• Julia

An application that gathers streaming data from twitter dataset , uses feature selection techniques to extract relevant keywords from a tweet , performs clustering to detect events . It also takes input from user such that window specified by user allows to further perform clustering which in turn uses a forest data structure to achieve it.

• UpdatedMar 14, 2018
• Jupyter Notebook

Anytime Lazy kNN: A fast anytime kNN search algorithm that assesses only true kNN candidates in a lazy fashion.

• UpdatedJun 18, 2024
• Python

This repository contains the material used to complete my Thesis for my BSc in Data Science and AI. My thesis attempts to explore the work started by previous alumni at my faculty which covered an algorithm variant of MCTS implementing a technique known as Sequential Halving, and I formulate an algorithm version not requiring constraints.

• UpdatedSep 2, 2024
• Jupyter Notebook

Implementation of various anytime motion planning algorithms

• UpdatedJan 17, 2022
• C++

Code for ABC-APTMC paper

• UpdatedApr 29, 2021
• MATLAB

Bachelor Thesis in Data Science and AI - My thesis aims to explore variations of the Anytime Sequential Halving algorithm. Specifically, I am looking at adjusting which nodes are pruned and the iteration budget given to them. Additionally, I am testing out different values of the exploration parameter in UCB1 to see how it affects the algorithm.

• UpdatedJun 2, 2025
• Jupyter Notebook

• UpdatedApr 2, 2017
• C++

ALEM (Anytime Lexicographic Enumeration for Multi-objective problems) proposes two new lexicographic enumeration algorithms: FI and FWI, capable of enumerating the Pareto front according to a provided lexicographic order.

• UpdatedAug 27, 2025
• Python

A model-free metareasoning library for interrupting and adjusting the parameters of anytime algorithms.

• UpdatedMay 7, 2021
• Python

An experimental framework for monitoring and controlling anytime algorithms with online performance prediction

• UpdatedJan 20, 2021
• Python

This project is made to demonstrate the capabilities of anytime algorithms in order to continually improve on solutions for NP hard programs through the ability to be stopped at any time.

• UpdatedAug 17, 2020
• Rust