Search Results for "genetic algorithm scheduling python"
Sort By:
Showing 35 open source projects for "genetic algorithm scheduling python"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
PyGAD
Source code of PyGAD, Python 3 library for building genetic algorithms
PyGAD is an open-source easy-to-use Python 3 library for building the genetic algorithm and optimizing machine learning algorithms. It supports Keras and PyTorch. PyGAD supports optimizing both single-objective and multi-objective problems. PyGAD supports different types of crossover, mutation, and parent selection. PyGAD allows different types of problems to be optimized using the genetic algorithm by customizing the fitness function. -
2
DualPipe
A bidirectional pipeline parallelism algorithm
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... -
3
Nevergrad
A Python toolbox for performing gradient-free optimization
...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. -
4
Appfl
Advanced Privacy-Preserving Federated Learning framework
APPFL (Advanced Privacy-Preserving Federated Learning) is a Python framework enabling researchers to easily build and benchmark privacy-aware federated learning solutions. It supports flexible algorithm development, differential privacy, secure communications, and runs efficiently on HPC and multi-GPU setups. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
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.
-
6
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
7
Evolutionary Algorithm
Evolutionary Algorithm using Python
Evolutionary Algorithm is an educational Python project that demonstrates evolutionary computation techniques such as genetic algorithms, evolution strategies, and neuroevolution in a clear and accessible way. Rather than being a single monolithic library, this repository provides a series of self-contained examples showing how different population-based search methods solve optimization problems and adapt candidate solutions over generations. -
8
NKTgLaw
Core library & API for the NKTg Law (Nguyen Khanh Tung). Includes core
Core library & API for the NKTg Law (Nguyen Khanh Tung). Includes core implementation, REST/gRPC API, and 150+ client wrappers -
9
Algorithm Visualizer
Interactive Online Platform that Visualizes Algorithms from Code
Hacker Scripts is a light-hearted collection of small automation and demo scripts that solve amusing everyday tasks or illustrate quick integrations with external services. The repo collects short programs (originally a set of shell and Ruby scripts) and many community contributed ports in other languages to show “how you might automate X” — for example sending a quick SMS, firing off an email, or triggering a coffee maker — with examples and scheduling snippets included. The README explains... -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
10
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.
-
11
scikit-opt
Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing
scikit-opt is a Python library for solving optimization problems with evolutionary and swarm-intelligence algorithms. It includes genetic algorithms, particle swarm optimization, differential evolution, simulated annealing, ant colony optimization, immune algorithms, and artificial fish swarms. The package can address continuous objectives, constrained problems, and combinatorial tasks such as the traveling salesman problem. -
12
Pokerbot: Pokerstars Partypoker GGPoker
Self playing pokerbot for partypoker, pokerstars and GGPoker
Please visit the wiki page for documentation how to run the bot http://www.github.com/dickreuter/Poker/ This pokerbot plays automatically on Partypoker, Pokerstars and GGPoker. It works with image recognition, montecarlo simulation and a basic genetic algorithm. The mouse is moved automatically and the bot can play for hours. All open source and you are welcome to contribute. New tables can easily be mapped with a new user interface. -
13
Smart Algorithm
Repository implementing a variety of intelligent algorithms
Smart-Algorithm is a repository implementing a variety of intelligent / metaheuristic optimization algorithms (e.g. Genetic Algorithm, Ant Colony, Particle Swarm, Immune Algorithm). The implementations are provided in multiple languages (Java, Python, MATLAB). The repository’s aim is to offer reference implementations of “smart” algorithms for tasks like route planning, optimization, or algorithm learning. -
14
Solid Python
A comprehensive gradient-free optimization framework written in Python
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. -
15
Sched-SPM
A C++ schedule generator based on Genetic Algorithm and Hill Climbing
Sched-SPM is a C++ schedule generator for software project staffing and rescheduling based on Genetic Algorithm (GA) and Hill Climbing (HC). This preliminary tool is mainly for academic purpose. It is implemented with GALib (http://lancet.mit.edu/ga/), an open-source toolkit of Genetic Algorithms in various platforms including Unix and Windows. The input and output files of the software are required as XML format. The input file includes tasks' and employees' information according to predefined file format. ... -
16
niGA
Heterogenous Multiprocessor Scheduling Using Genetic Algorithms
Implementation of task scheduling using Genetics algorithm for heterogeneous parallel programming -
17
PyGAO
Genetic Algorithm Optimization for Python
A simple interface for performing genetic algorithm optimization for numerical problems. I am starting with a stripped-down version, where a solution can be described using a single vector of float numbers. Eventually, I will expand to more generic data structures and add multiple-species search options. For the time being, I have no plans of developing a GUI. For now, this is strictly a computational module. -
18
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.
-
19
Evolving Objects
This project have been merged within Paradiseo.
See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/) -
20
PyPedal is a Python module that provides tools for the manipulation of pedigrees, simple visualization of pedigrees, and the calculation of measures of genetic diversity from pedigrees.
-
21
ats - Automated Testing System
Object oriented Python-based tool for test automation.
...ATS provides the capability to run serial or parallel tests simultaneously up to the resource limits it has been given (i.e. some number of processors on which to run). Tests can be given a priority rating and be dependent upon other tests, and these features are accounted for in its scheduling algorithm. The software is configurable and extensible. ATS provides numerous options for creating dependent chains of tests, filtering based on various criteria, and running tests with custom arguments. -
22
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
-
23
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.
-
24
PGAF provides a framework tuned, user-specific genetic algorithms by handling I/O, UI, and parallelism. It is designed for optimizing functions that take a "very long time" to evaluate.
-
25
Springbots is a python application which takes a set of 2d physical structures built with nodes and movable springs and evolve them for specific tasks like walking, swimming and jumping using genetic algorithm.
