Search Results for "parallel genetic algorithm"
Sort By:
Showing 37 open source projects for "parallel genetic algorithm"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
G-P - Global EOR SolutionWith G-P's industry-leading Employer of Record (EOR) and Contractor solutions, you can hire, onboard and manage teams in 180+ countries — quickly and compliantly — without setting up entities.
-
1
Genetic algorithm for EOM
A python GA code for EOM in SAXS/WAXS
Because GAjoe of ATSAS cannot deal with WAXS range, and no parameters can be modified. I made a code by myself to use GA for finding best EOM for SAXS/WAXS. The project need ATSAS crysol and a folder with multiple pdb files to use. -
2
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. -
3
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.
-
4
openTSNE
Extensible, parallel implementations of t-SNE
openTSNE is a modular Python implementation of t-Distributed Stochasitc Neighbor Embedding (t-SNE) [1], a popular dimensionality-reduction algorithm for visualizing high-dimensional data sets. openTSNE incorporates the latest improvements to the t-SNE algorithm, including the ability to add new data points to existing embeddings [2], massive speed improvements [3] [4] [5], enabling t-SNE to scale to millions of data points, and various tricks to improve the global alignment of the resulting... -
Create and run cloud-based virtual machines.Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.
-
5
Nevergrad
A Python toolbox for performing gradient-free optimization
Nevergrad is a Python library for derivative-free optimization, offering robust implementations of many algorithms suited for black-box functions (i.e. functions where gradients are unavailable or unreliable). It targets hyperparameter search, architecture search, control problems, and experimental tuning—domains in which gradient-based methods may fail or be inapplicable. The library provides an easy interface to define an optimization problem (parameter space, loss function, budget) and... -
6
TensorHouse
A collection of reference Jupyter notebooks and demo AI/ML application
TensorHouse is a scalable reinforcement learning (RL) platform that focuses on high-throughput experience generation and distributed training. It is designed to efficiently train agents across multiple environments and compute resources. TensorHouse enables flexible experiment management, making it suitable for large-scale RL experiments in both research and applied settings. -
7
YAPF
A formatter for Python files
YAPF is a Python code formatter that automatically rewrites source to match a chosen style, using a clang-format–inspired algorithm to search for the “best” layout under your rules. Instead of relying on a fixed set of heuristics, it explores formatting decisions and chooses the lowest-cost result, aiming to produce code a human would write when following a style guide. You can run it as a command-line tool or call it as a library via FormatCode / FormatFile, making it easy to embed in... -
8
Scrapyd
A service daemon to run Scrapy spiders
...A common (and useful) convention to use for the version name is the revision number of the version control tool you’re using to track your Scrapy project code. For example: r23. The versions are not compared alphabetically but using a smarter algorithm (the same packaging uses) so r10 compares greater to r9, for example. Scrapyd is an application (typically run as a daemon) that listens to requests for spiders to run and spawns a process for each one. Scrapyd also runs multiple processes in parallel, allocating them in a fixed number of slots given by the max_proc and max_proc_per_cpu options, starting as many processes as possible to handle the load. -
9
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.
-
Lightspeed golf course management softwareFrom tee sheet management, point of sale and payment processing to marketing, automation, reporting and more—Lightspeed is built for the pro shop, restaurant, back office, beverage cart and beyond.
-
10
Crunch
Insane(ly slow but wicked good) PNG image optimization
Crunch is an image compression tool for lossy PNG image file optimization. Using a combination of selective bit depth, color palette reduction and color type, as well as zopfli DEFLATE compression algorithm encoding that employs the pngquant and zopflipng PNG optimization tools, Crunch is effectively able to optimize and compress images with minimal decrease in image quality. While it may produce file size gains larger than those produced by lossless approaches, the impact on image quality... -
11
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. -
12
lzhw
LZHW Windows command line lossless compression tool for tabular files
LZHW Command Line Lossless Compression Tool is a Windows command line tool used to compress and decompress files from and to any form, csv, excel etc without any dependencies or installations. Using an optimized algorithm (LZHW) developed from Lempel-Ziv, Huffman and LZ-Welch algorithms. The tool can work in parallel and most of its code is written in Cython, so it is pretty fast. It is based on python lzhw library. Full tool documentation can be found at: https://mnoorfawi.github.io/lzhw/6%20Using%20the%20lzhw%20command%20line%20tool/ While the documentation for the python library is at: https://mnoorfawi.github.io/lzhw/ -
13
RecNN
Reinforced Recommendation toolkit built around pytorch 1.7
This is my school project. It focuses on Reinforcement Learning for personalized news recommendation. The main distinction is that it tries to solve online off-policy learning with dynamically generated item embeddings. I want to create a library with SOTA algorithms for reinforcement learning recommendation, providing the level of abstraction you like. -
14
Evolution Strategies Starter
Code for the paper "Evolution Strategies.."
evolution-strategies-starter is an archived OpenAI research project that provides a distributed implementation of the algorithm described in the paper “Evolution Strategies as a Scalable Alternative to Reinforcement Learning” by Tim Salimans, Jonathan Ho, Xi Chen, and Ilya Sutskever. The repository demonstrates how to scale Evolution Strategies (ES) for reinforcement learning tasks using a master-worker architecture, where the master node broadcasts parameters to multiple workers, and the... -
15
As of August 2018 Spheral++ has moved to Github -- please see the current repository at https://github.com/jmikeowen/spheral We are leaving a frozen version here on SourceForge for historical reasons. Spheral++ provides a steerable parallel environment for performing coupled hydrodynamical & gravitational numerical simulations. Hydrodynamics and gravity are modelled using particle based methods (SPH and N-Body).
-
16
Universe Starter Agent
A starter agent that can solve a number of universe environments
...Its purpose is to serve as a baseline or reference implementation so researchers or developers can see how to build agents that operate in real-time, visual environments (e.g., games, browser apps) via pixel observations and keyboard/mouse actions. Under the hood, this starter agent implements a version of the A3C (Asynchronous Advantage Actor-Critic) algorithm, adapted for the specific challenges of Universe environments (e.g., network latency, VNC streaming, asynchronous observations). The repo includes modules like train.py, worker.py, model.py, a3c.py, and envs.py to support training, parallel worker management, policy/critics, and environment wrappers. -
17
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. -
18
Eye candy showing parallel Conway's Life games in the bit planes of the screen, using boolean BitBlt operations. (Independently rediscovered algorithm given already in Smalltalk-80 Blue Book, by the inventors of BitBlt.)
-
19
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. -
20
Game of Turmites
Conway's Game of Life and Turmites Combined!
...It's all very randomly generated, and there is no way for any user input. I'll consider putting some in later. I had been wanting to make the Game of Life for some time as well as make some kind of genetic algorithm based code. So, here is what I came up with. While this may just seem like simplify a graphical display of what boredom looks like... well, it really doesn't go much past that point. If you Don't know what Conway's game of life is: It's the Black (Or white, I may have changed them) cells that follow a simple set of instructions based on the state of its adjacent cells. ... -
21
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.
-
22
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/) -
23
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.
-
24
A genetic algorithm in Python for evolving programs that write a given string to an allocated dataspace, using a made-up machine language with only 7 instructions and flow reversal.
-
25
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
