Search Results for "graph path"

...It presents diagrams and documentation describing the evolution of models such as LeNet, AlexNet, VGG, ResNet, DenseNet, and Inception networks. The repository organizes these architectures into a structured learning path that helps learners understand how deep learning models improved over time through changes in depth, architectural complexity, and training techniques. In addition to neural networks used for image classification, the project also references broader AI fields such as generative adversarial networks, natural language processing, and graph neural networks.

ML Retreat is an open-source learning repository that serves as a structured journal documenting advanced topics in machine learning and artificial intelligence. The project compiles detailed notes, technical explanations, and curated resources that guide readers through complex concepts across modern AI research. Rather than functioning as a traditional tutorial series, the repository is organized as a learning journey that progressively explores increasingly advanced subjects. Topics...

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

Deep-Learning-with-PyTorch-Tutorials is a companion repository for an introductory deep learning course built around PyTorch. It provides source code, notebooks, and presentation materials for a practical video-based learning path. The lessons begin with PyTorch setup, tensors, indexing, mathematical operations, gradients, and basic optimization. They then move into neural networks, logistic regression, multilayer perceptrons, CNNs, ResNet, RNNs, LSTMs, autoencoders, VAEs, GANs, graph convolutional networks, and transfer learning. The repository is designed for learners who want to connect deep learning concepts with executable examples. ...

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.