aprusik
I am a software engineer with a wide range of experience including AI, ML, web & software development, graphics, linguistics and more.
Boston, MA
Pinned Repositories
cities
A procedural city map generator.
EXERCISE-CNF-satisfiability
Deterimines wheter or not a formula presented in conjunctive normal form can be satisfied, and how to do so.
EXERCISE-CSP-graph-solver
Solves a Constraint Satisfaction Problem provided via standard DIMACS graph format and outputs DIMACS color format.
EXERCISE-digit-OCR
A program designed to recognize digits painted on a grid with up to 4 different weight values. No trainining data included at the moment..
EXERCISE-free-space-motion-planner
Plans a route through a map from start to goal while avoiding obsticals. Similar to my grid-based motion planner, but the moving entity is not constrained to grid movement.
EXERCISE-grid-based-motion-planner
Plans a route through an arbitrary grid with blocked cells, empty cells, and goal cells so that each goal is visited.
EXERCISE-keyword-search
A simple search algorithm that allows a user to retrieve sentences from a file with the queried word.
EXERCISE-line-finder
Identifies straigt lines amongst a 2D grid of points with noise.
EXERCISE-MDP-planner
Plans an optimal policy for a Markov Decision Process.
EXERCISE-monte-carlo-localiztion
Uses Monte-Carlo Localization to estimate the location of a robot on a given map from sensor data.
aprusik's Repositories
aprusik/cities
A procedural city map generator.
aprusik/EXERCISE-CNF-satisfiability
Deterimines wheter or not a formula presented in conjunctive normal form can be satisfied, and how to do so.
aprusik/EXERCISE-CSP-graph-solver
Solves a Constraint Satisfaction Problem provided via standard DIMACS graph format and outputs DIMACS color format.
aprusik/EXERCISE-digit-OCR
A program designed to recognize digits painted on a grid with up to 4 different weight values. No trainining data included at the moment..
aprusik/EXERCISE-free-space-motion-planner
Plans a route through a map from start to goal while avoiding obsticals. Similar to my grid-based motion planner, but the moving entity is not constrained to grid movement.
aprusik/EXERCISE-grid-based-motion-planner
Plans a route through an arbitrary grid with blocked cells, empty cells, and goal cells so that each goal is visited.
aprusik/EXERCISE-keyword-search
A simple search algorithm that allows a user to retrieve sentences from a file with the queried word.
aprusik/EXERCISE-line-finder
Identifies straigt lines amongst a 2D grid of points with noise.
aprusik/EXERCISE-MDP-planner
Plans an optimal policy for a Markov Decision Process.
aprusik/EXERCISE-monte-carlo-localiztion
Uses Monte-Carlo Localization to estimate the location of a robot on a given map from sensor data.
aprusik/EXERCISE-ray-tracing-weekend
My implementation of Peter Shirley's "Ray Tracing in One Weekend"
aprusik/EXERCISE-state-progression-planner
Given a sequential STRIPS domain, an initial state, and a goal state, plans the shortest sequence of actions to complete the problem.
aprusik/EXERCISE-theorem-prover
Parses a theory of multiple clauses in Skiolemized CNF as well as a query and proves that theory and query using resolution refutation (if possible).
aprusik/soundscape
Sound Maestro: The Dynamic Soundscape Builder