Aaron BrennanGenetic algorithmsA genetic algorithm is a technique for problem-solving that mimics the course of natural selection. It is a search heuristic that draws…Jan 22, 2023Jan 22, 2023
Aaron BrennanMonte Carlo tree searchMonte Carlo Tree Search (MCTS) is a computer algorithm that is used to make decisions in games or other situations where there are many…Jan 22, 2023Jan 22, 2023
Aaron BrennanA* (A star) algorithmA* is a search algorithm that is used to find the shortest path between two points in a graph. It uses a combination of the distance…Jan 21, 2023Jan 21, 2023
Aaron BrennanDijkstra’s AlgorithmThe Dijkstra algorithm is a technique for determining the shortest route through a network of locations. Dijkstra’s technique, for…Jan 21, 2023Jan 21, 2023
Aaron BrennanMinimax algorithm and alpha-beta pruningThe minimax algorithm is a decision-making algorithm used in game theory and artificial intelligence to find the best move for a player in…Jan 20, 2023Jan 20, 2023
Aaron BrennanUninformed search algorithmsAn uninformed search algorithm, also known as a blind search algorithm, is a type of search algorithm that does not use any additional…Jan 19, 2023Jan 19, 2023
Aaron BrennanData Augmentation tipsData augmentation is a technique used to artificially increase the size of a dataset by generating new data samples from the existing ones…Jan 7, 2023Jan 7, 2023
Aaron BrennanNeurosymbolic AINeurosymbolic AI is a type of artificial intelligence that combines the strengths of two different approaches to AI: symbolic AI and…Jan 7, 2023Jan 7, 2023
Aaron BrennanSymbolic AIArtificial intelligence (AI) has come a long way since the field was first established in the 1950s. One type of AI, known as symbolic AI…Jan 7, 2023Jan 7, 2023
Aaron BrennanUnder-fitting vs over-fittingOverfitting and underfitting are two common problems that occur when training machine learning models.Jan 7, 2023Jan 7, 2023
