Media Summary: CS51 (CS e-250) Final Project. Implementing Dijkstra, Bellman-Ford and Johnson in OCaml. Finite Impulse Response filters realized in OCaml. Implementation of A* pathfinding algorithm and GUI interface for user interaction.
Cs51final - Detailed Analysis & Overview
CS51 (CS e-250) Final Project. Implementing Dijkstra, Bellman-Ford and Johnson in OCaml. Finite Impulse Response filters realized in OCaml. Implementation of A* pathfinding algorithm and GUI interface for user interaction. Lean and Mean Text Summaries Made by Michael Mancinelli, Ben Falloon, Matt Timoney, and Chris Splinter at Harvard ... Cellular Automata Simulation written in OCAML Team: Laura Peterman Ryan Gallagher Yelena Tsitkin. Aaron Landesman, Albert Wu, Lucy Cheng, Ray Qian A genetic algorithm approach to determining an optimal solution to the ...
Spring 2015 Computer Science 51 Final Project. Olivia Angiuli, Martin Reindl, Ty Rocca, Wilder Wohns.
