aind
There are 57 repositories under aind topic.
lucko515/speech-recognition-neural-network
This is the end-to-end Speech Recognition neural network, deployed in Keras. This was my final project for Artificial Intelligence Nanodegree @Udacity.
diegocasmo/udacity-aind
A repository of multiple projects and labs done in the Udacity Artificial Intelligence Nanodegree (aind).
ZahoreczTibor/product_management
Tibor Zahorecz product management projects.
udacity/AIND-Chiron
Chiron submission configuration files
optimistanoop/Artificial-Intelligence-Nanodegree
This repo contains all the projects developed during my AIND journey.
sagarnildass/AIND_nanodegree
Udacity Artificial Intelligence Nanodegree Projects
buffos/aind_projects
projects for Udacity's AI nanodegree
JacobPolloreno/Artificial-Intelligence-ND
Projects from Udacity's Artificial Intelligence Nanodegree
kakumar/AIND-Sudoku
Sudoku Solver
lucko515/Isolation-AI-agent
This is the second project for Artificial Intelligence Nanodegree @Udacity . This is the game Isolation playing agent.
lucko515/pacman-AI
This is the Pacman AI agent implemented as a search problem with DFS, UCS, BFS, A* with different heuristic functions. This project was a part of Artificial Intelligence Nanodegree @Udacity.
lucko515/rnn-sherlock-holmes-book
This project is a part of AIND @Udacity. Here the RNN (Recurrent neural network) is used to generate text. The RNN is implemented using Keras.
lucko515/simulated-annealing
One of many projects done in Artificial Intelligence Nanodegree @Udacity. This project was to use Simulated Annealing algorithm to solve Traveling salesman problem.
royveshovda/AIND-P2-build-a-game-playing-agent
Part of Artificial Intelligence Nanodegree (AIND) from Udacity. Second project in Term 1 in the subject of the minimax algorithm.
ryantd/Classical-Planning
🤖 Classical Planning with AI, from Udacity AI Nanodegree
sunsided/AIND-Planning
State-Space Planning using A* Progression Search with Planning Graph Heuristics
sunsided/AIND-Recognizer
Sign Language Recognition using Hidden Markov Models
sunsided/AIND-Sudoku
Solving Sudoku using constraint propagation and depth-first state-space search
fdasilva59/Udacity-Artificial-Intelligence-Nanodegree-Planning
Repository for the Planning Search project of the Udacity AI Nanodegree
juimin/learning
A collection of starter bits for learning about various topics as well as an archive of school work
rimoune/AIND-Artificial-Intelligence
Artificial Intelligence projects - Udacity
rimoune/AIND-Build_a_Game_Playing_Agent
Build an adversarial search agent to play the game "Isolation"
rimoune/AIND-Implement_a_Planning_Search
Implementation of a Planning Search Agent
rimoune/AIND2-Dog_Breed_Classifier
Use CNNs and Transfer Learning to predict dog breed from dog images
ryantd/Adversarial-Search
🤖 Adversarial Search with AI, from Udacity AI Nanodegree
shambakey1/aind_classical_planning
My implementation of the AIND classical planning project. The required modifications are included in the "my_planning_graph.py". The comparison results among different algorithms (e.g., depth-first, breadth-first, A*, greedy, uniform-cost) with different heuristics (e.g., unmet goals, max-level, level-sum, set-level) in terms of actions, expansions, time, and optimality is shown in the report.pdf file
fdasilva59/Udacity-Artificial-Intelligence-Nanodegree-Constraint-Satisfaction
Repository for the Constraint Satisfaction Problem lab to solve the N-Queens problem (Udacity AI Nanodegree)
fdasilva59/Udacity-Artificial-Intelligence-Nanodegree-Recognizer
Repository for the Sign Language Recognizer project of the Udacity AI Nanodegree
fdasilva59/Udacity-Artificial-Intelligence-Nanodegree-Simulated-Annealing
Repository for the Simulated Annealing exercise of the Udacity AI Nanodegree
rimoune/AIND-Build_a_Sign_Language_Recognizer
Build a sign language recognition system using Hidden Markov Models
rimoune/AIND-Solve_a_Sudoku_with_AI
Diagonal Sudoku Solver
ryantd/Solve-Sudoku
🤖 Solve Sudoku with AI, from Udacity AI Nanodegree
shambakey1/MCTS_adversial_search
Implementation of Udacity Nanodegree adversial search project using Monte Carlo Tree Search (MCTS). My implementation is a modification of the MCTS at "https://github.com/int8/monte-carlo-tree-search" to suit the project's knights isolation game. My implementation is in the "my_custom_player.py" file