Bolt is a deep learning library with high performance and heterogeneous flexibility.

A tool for integrating Growatt Noah 2000 home batteries with Home Assistant via MQTT, enabling real-time monitoring and control of your energy storage system.

Watch all videos from a channel in chronological order (oldest to newest)

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover

A GPA calculator in JavaFX attempting to use the Model View Controller (MVC) pattern

PHP template allows linking to any folder or file without manually navigating up directories with ../

Network Flow: Given a directed graph with edge capacities and vertex demands, is there a circulation of flow?

Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)

Greedy Algorithm to find the maximum number of mutually compatible jobs

noah go node

Este repositorio contiene todo lo que involucra al hardware. Aquí se encuentran los modelos 3D, electronica, PCB y Firmwares del robot.

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

Algorithm to find possible sets in the game Set using an iterative implementation of n choose 3 for combinations

Binary hexadecimal converter

Git Pages is kinda cool :)

A list of projects I've worked on. GitHub's organization is lacking in my opinion, so this serves as an index & root of all my work (I'm Noah Patullo, not Pattullo or Patulo. I have a unique name & this should help clarify who I am)

Autofill NetID when logging into Blackboard & syncs across signed-in Chrome browsers

Shortest Paths from every vertex to a goal vertex allowing negative-weight edges (when Dijkstra's fails)

Invert Selection of checkboxes or radio buttons in an HTML form

Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph