Search Results for "genetic algorithm scheduling python"

DualPipe is a bidirectional pipeline parallelism algorithm open-sourced by DeepSeek, introduced in their DeepSeek-V3 technical framework. The main goal of DualPipe is to maximize overlap between computation and communication phases during distributed training, thus reducing idle GPU time (i.e. “pipeline bubbles”) and improving cluster efficiency. Traditional pipeline parallelism methods (e.g. 1F1B or staggered pipelining) leave gaps because forward and backward phases can’t fully overlap...

...The library provides an easy interface to define an optimization problem (parameter space, loss function, budget) and then experiment with multiple strategies—evolutionary algorithms, Bayesian optimization, bandit methods, genetic algorithms, etc. Nevergrad supports parallelization, budget scheduling, and multiple cost/resource constraints, allowing it to scale to nontrivial optimization problems. It includes visualization tools and diagnostic metrics to compare strategy performance, track parameter evolution, and detect stagnation.

pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.

Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.

Solid is a Python framework for gradient-free optimization. It contains basic versions of many of the most common optimization algorithms that do not require the calculation of gradients, and allows for very rapid development using them.

This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.

See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/)

Free and easy to implement algorithm that can be used for resource leveling in Gantt projects. Uses resources assignment policies, availibility calendars, tasks\' priorities, dependencies, sizings, complexity due to human communication.

This project is a complete cross-platform (Windows, Linux) framework for Evolutionary Computation in pure python. See the project site at http://pyevolve.sourceforge.net or the blog at http://pyevolve.sourceforge.net/wordpress

Based on the introduction of Genetic Algorithms in the excellent book "Collective Intelligence" I have put together some python classes to extend the original concepts.

The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.

Galileo is a library for developing custom distributed genetic algorithms developed in Python. It provides a robust set of objects that can be used directly or as the basis of derived objects. Its modularity makes it easy to extend the functionality. The

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.