Search Results for "genetic algorithm scheduling"
Sort By:
Showing 265 open source projects for "genetic algorithm scheduling"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
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.
-
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
morilog/jalali
This Package helps developers to easily work with Jalali
Jalali calendar is a solar calendar that was used in Persia, variants of which today are still in use in Iran as well as Afghanistan. Read more on Wikipedia or see Calendar Converter. Calendar conversion is based on the algorithm provided by Kazimierz M. Borkowski and has a very good performance. CalendarUtils class was ported from jalaali/jalaali-js. -
4
PlatEMO
Evolutionary multi-objective optimization platform
...PlatEMO consists of a number of MATLAB functions without using any other libraries. Any machines able to run MATLAB can use PlatEMO regardless of the operating system. PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms published in top journals after 2010. Users can select various figures to be displayed, including the Pareto front of the result, the Pareto set of the result, the true Pareto front, and the evolutionary trajectories of any performance indicator values. ... -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
DualPipe
A bidirectional pipeline parallelism algorithm
...DualPipe addresses that by scheduling micro-batches from both ends of the pipeline in a bidirectional fashion—i.e. some micro-batches flow forward while others flow backward—so that computation on one partition can coincide with communication for another. -
6
FSRS4Anki
A modern Anki custom scheduling based on Free Spaced Repetition
A modern spaced-repetition scheduler for Anki based on the Free Spaced Repetition Scheduler algorithm. -
7
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. -
8
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. -
9
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... -
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
10
Evolutionary Algorithm
Evolutionary Algorithm using Python
...Users can explore basic genetic algorithm setups, match phrase examples, pathfinding challenges, and microbial GA variants, as well as evolution strategy approaches like NES. The project also links classical evolutionary approaches with neural networks, illustrating how evolution can be used for model training in reinforcement learning and supervised contexts. -
11
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.
-
12
glider
glider is a forward proxy with multiple protocols support
...We can set up local listeners as proxy servers, and forward requests to internet via forwarders. Act as both proxy client and proxy server(protocol converter). Flexible proxy & protocol chains. Load balancing with the following scheduling algorithm, rr: round robin, ha: high availability, lha: latency based high availability, dh: destination hashing. Rule & priority based forwarder choosing: Config Examples. DNS forwarding server. Force upstream querying by TCP. Association rules between dns and forwarder choosing. Association rules between dns and ipset. dns cache support. ... -
13
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... -
14
Evolutionary Computation Framework
C++ framework for application of any type of evolutionary computation.
ECF is a framework intended for application of any type of evolutionary computation (GA/GP, DE, Clonalg, ES, PSO, ABC, GAn, local search...). It offers simplicity for the end-user (parameterless usage, tutorial) and customization for experienced EC practicioners. -
15
Motofit co-refines Neutron and X-ray reflectometry data, using the Abeles matrix / Parratt recursion and least squares fitting (Genetic algorithm or Levenberg Marquardt). It works in the IGOR Pro environment (TM Wavemetrics).
-
16
Scheduler Simulation
Thread Scheduler with custom asynchronous messaging in VC++
Custom thread scheduler with custom data-structure and scheduling algorithm. Custom Mutex, Semaphore implementation and asynchronous messaging system that combines Observer and Visitor patterns. System is implemented on top of Windows system and not ported to any hardware, uses Windows thread for context saving. Code also has tested common data-structure implementation. System is designed for multi-core platform. -
17
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
GeneticSharp is a fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs). Can be used in any kind of .NET 6, .NET Standard and .NET Framework apps, like ASP .NET MVC, ASP .NET Core, Blazor, Web Forms, UWP, Windows Forms, GTK#, Xamarin, MAUI and Unity3D games. GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). ... -
18
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.
-
19
genome-wb3-asm
A Genetic Algorithm Library written in Amiga Workbench 3.x assembler
-
20
MACE
Deep learning inference framework optimized for mobile platforms
Mobile AI Compute Engine (or MACE for short) is a deep learning inference framework optimized for mobile heterogeneous computing on Android, iOS, Linux and Windows devices. Runtime is optimized with NEON, OpenCL and Hexagon, and Winograd algorithm is introduced to speed up convolution operations. The initialization is also optimized to be faster. Chip-dependent power options like big.LITTLE scheduling, Adreno GPU hints are included as advanced APIs. UI responsiveness guarantee is sometimes obligatory when running a model. Mechanism like automatically breaking OpenCL kernel into small units is introduced to allow better preemption for the UI rendering task. ... -
21
The ASCO project aims to bring circuit optimization capabilities to existing SPICE simulators using a high-performance parallel differential evolution (DE) optimization algorithm. It supports Eldo, HSPICE, LTspice, Spectre, and Qucs.
-
22
Triangula
Generate high-quality triangulated and polygonal art from images
Generate high-quality triangulated and polygonal art from images. Triangula uses a modified genetic algorithm to triangulate or polygonate images. It works best with images smaller than 3000px and with fewer than 3000 points, typically producing an optimal result within a couple of minutes. For a full explanation of the algorithm, see this page in the wiki. You can try the algorithm out in your browser, but the desktop app will typically be 20-50x faster. ... -
23
Starlight Fabric
Rewrites the light engine to fix lighting performance
Starlight is a performance optimization project for Minecraft that completely rewrites the game’s internal lighting engine to improve efficiency and reduce lighting-related lag. The original Minecraft lighting system can be computationally expensive when generating terrain or updating large structures, which can cause performance problems on servers and heavily modded environments. Starlight replaces this system with a redesigned algorithm that processes lighting calculations more... -
24
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. -
25
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.
