Search Results for "parallel genetic algorithm" - Page 2
Sort By:
Showing 179 open source projects for "parallel genetic algorithm"
View related business solutions-
SoftCo: Enterprise Invoice and P2P Automation SoftwareSoftCo Accounts Payable Automation processes all PO and non-PO supplier invoices electronically from capture and matching through to invoice approval and query management. SoftCoAP delivers unparalleled touchless automation by embedding AI across matching, coding, routing, and exception handling to minimize the number of supplier invoices requiring manual intervention. The result is 89% processing savings, supported by a context-aware AI Assistant that helps users understand exceptions, answer questions, and take the right action faster.
-
Failed Payment Recovery for Subscription BusinessesFlexPay’s innovative platform uses multiple technologies to achieve the highest number of retained customers, resulting in reduced involuntary churn, longer life span after recovery, and higher revenue. Leading brands like LegalZoom, Hooked on Phonics, and ClinicSense trust FlexPay to recover failed payments, reduce churn, and increase customer lifetime value.
-
1
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. -
2
OpenDino
Open Source Java platform for Optimization, DoE, and Learning.
...It provides a graphical user interface (GUI) and a platform which simplifies integration of new algorithms as "Modules". Implemented Modules Evolutionary Algorithms: - CMA-ES - (1+1)-ES - Differential Evolution Deterministic optimization algorithm: - SIMPLEX Learning: - a simple Artificial Neural Net Optimization problems: - test functions - interface for executing other programs (solvers) - parallel execution of problems - distributed execution of problems via socket connection between computers Others: - data storage - data analyser and viewer -
3
Xoptfoil
Airfoil optimization with Xfoil
Airfoil optimization using the highly-regarded Xfoil engine for aerodynamic calculations. Starting with a seed airfoil, Xoptfoil uses particle swarm, genetic algorithm and direct search methodologies to perturb the geometry and maximize performance. The user selects a number of operating points over which to optimize, desired constraints, and the optimizer does the rest. -
4
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. ...
-
Iris Powered By Generali - Iris puts your customer in control of their identity.Iris Identity Protection API sends identity monitoring and alerts data into your existing digital environment – an ideal solution for businesses that are looking to offer their customers identity protection services without having to build a new product or app from scratch.
-
5
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).
-
6
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. -
7
Implementation of RC4 Algorithm to be executed in parallel threads using Java's standard libraries for parallel executions. Wanted to check the performance of RC4 in different hardware platforms. This is the code base related to the following research paper: http://www.ijcaonline.org/archives/volume60/number16/9780-4424
-
8
popt4jlib
Parallel Optimization Library for Java
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 network flow and other graph algorithms. ... -
9
GAVGA
A Genetic Algorithm for Viral Genome Assembly
GAVGA is a Genetic Algorithm for Viral Genome Assembly. It can be used in the assembly of small genomes, like viral ones. -
AestheticsPro Medical Spa SoftwareAestheticsPro is the most complete Aesthetics Software on the market today. HIPAA Cloud Compliant with electronic charting, integrated POS, targeted marketing and results driven reporting; AestheticsPro delivers the tools you need to manage your medical spa business. It is our mission To Provide an All-in-One Cutting Edge Software to the Aesthetics Industry.
-
10
Machine-Learning-Flappy-Bird
Machine Learning for Flappy Bird using Neural Network
...The neural network receives input features representing the bird’s position relative to the next obstacle and determines whether the bird should flap or remain idle. Over successive generations, a genetic algorithm evolves the neural networks by selecting high-performing agents and recombining their parameters to produce improved offspring. This process allows the AI agents to gradually learn better strategies for navigating the obstacles and surviving longer in the game environment. -
11
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. -
12
GenCodeGenerator
C++ class to generate biologically plausible genetic codes
...By default, the class "GeneticCode" generates alternative genetic codes, with the reqirement of block structure, and, optionally, with the assumption of stereochemical or biosynthetic models (to impose the assumption of the adaptive model, simply filter the codes using the error_cost() function). See Appendix in Makukov & shCherbak (2017) for the description of the algorithm. The code requires Qt 5. -
13
Swift AI
The Swift machine learning library
Swift AI is a high-performance deep learning library written entirely in Swift. We currently offer support for all Apple platforms, with Linux support coming soon. Swift AI includes a collection of common tools used for artificial intelligence and scientific applications. A flexible, fully-connected neural network with support for deep learning. Optimized specifically for Apple hardware, using advanced parallel processing techniques. We've created some example projects to demonstrate the... -
14
diauxic growth model ensemble
An ensemble of models showing diauxic growth behavior
...Carbon catabolite repression (CCR) is the main mechanism controlling carbohydrate uptake in bacteria, and therefore also controlling whether or not different carbon sources are metabolized in parallel or sequentially. Although described as a paradigm of the regulation of bacterial metabolism, the underlying mechanisms remain controversial. The models in the ensemble can be categorized according to regulatory, stoichiometric, and physiological constraints and differ from each other on only a single aspect. We distinguish four groups of models: (1) flux balance models that only define reaction kinetics for substrate uptake and by-product excretion, (2) kinetic models without and (3) kinetic models with regulation on the metabolic and/or genetic level, and (4) resource allocation models. -
15
CUDA-MEME
Ultrafast scalable motif discovery algorithm using GPU computing
mCUDA-MEME is a well-established ultrafast scalable motif discovery algorithm based on MEME (version 4.4.0) algorithm for multiple GPUs using a hybrid combination of CUDA, MPI and OpenMP parallel programming models. This algorithm is a further extension of CUDA-MEME (based on MEME version 3.5.4) with respect to accuracy and speed and has been tested on a GPU cluster with eight compute nodes and two Fermi-based Tesla S2050 (and Tesla-based Tesla S1070) quad-GPU computing systems, running the Linux OS with the MPICH2 library. ... -
16
GAKNN is a data mining software for gene annotation data. GAKNN is built with k- Nearest Neighbour algorithm optimized by the genetic algorithm. Gene annotation datasets saved under .csv or .arff formats with Gene Ontology or FunCat categorization can use GAKNN to predict gene functions.
-
17
GA-tools
general genetic algorithms optimization fortran 95 routines
High level optimization routines in Fortran 95 for optimization problems using a genetic algorithm with elitism, steady-state-reproduction, dynamic operator scoring by merit, no-duplicates-in-population. Chromosome representation may be integer-array, real-array, permutation-array, character-array. Single objective and multi-objective maximization routines are present. Possible to incorporate own crossover and mutation operators exclusively or in addition to standard operators that are included by default. ... -
18
cupSODA
Deterministic simulator of mass-action based models
cupSODA is a simulator of biological systems that exploits the remarkable memory bandwidth and computational capability of GPUs. cupSODA allows to efficiently execute in parallel large numbers of simulations, which are usually required to investigate the emergent dynamics of a given biological system under different conditions. cupSODA works by automatically deriving the system of ordinary differential equations from a reaction-based mechanistic model, defined according to the mass-action kinetics, and then exploiting the numerical integration algorithm, LSODA -
19
PhyloPart
automated partition of phylogenetic trees
Understanding the determinants of virus transmission is a fundamental step for effective design of screening and intervention strategies to control viral epidemics. Phylogenetic analysis can be a valid approach for the identification of transmission chains, and very-large data sets can be analysed through parallel computation. Here we propose and validate a new methodology for the partition of large-scale phylogenies and the inference of transmission clusters. This approach, on the basis of a depth-first search algorithm, conjugates the evaluation of node reliability, tree topology and patristic distance analysis. -
20
MicroGP
A multi-purpose extensible self-adaptive evolutionary algorithm
MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4 -
21
tsp-problem-ga-aco-comparisson
Genetic Algorithm and Ant Colony to solve the TSP problem
This project compares the classical implementation of Genetic Algorithm and Ant Colony Optimization, to solve a TSP problem. It's possible to define the number of cities to visit , and also interactively create new cities to visit in a 2D spatial panel. A total distance is given for AG and ACO solution at end. -
22
theoEA_Code
genetic algorithm for optimizing planar optical antennas
-
23
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary... -
24
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. ... -
25
MORO can conveniently analyze the relationship between network modularity and robustness. We employed an existing algorithm to analyze the modularity of directed graphs and a Boolean network model for robustness calculation. In particular, to ensure the robustness algorithm’s applicability to large-scale networks, we implemented it as a parallel algorithm by using the OpenCL library. A batch-mode simulation function was also developed to verify whether an observed relationship between modularity and robustness is conserved in a large set of randomly structured networks. ...
