Search Results for "genetic algorithms"
Sort By:
Showing 367 open source projects for "genetic algorithms"
View related business solutions-
HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
Vertex AI offers everything you need to build and use generative AI—from AI solutions, to Search and Conversation, to 130+ foundation models, to a unified AI platform.
-
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
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). A Blazor... -
3
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 languages... -
4
Evolutionary.jl
Evolutionary & genetic algorithms for Julia
A Julia package for evolutionary & genetic algorithms. The package can be installed with the Julia package manager. -
Exact Payments delivers easy-to-integrate embedded payment solutions enabling you to rapidly onboard merchants, instantly activate a variety of payment methods and accelerate your revenue — delivering an end-to-end payment processing platform for SaaS businesses.
-
5
Java·Applied·Geodesy·3D
Least-Squares Adjustment Software for Geodetic Sciences
JAG3D is no longer developed at source-forge, and has moved to GitHub. Please visit https://github.com/applied-geodesy/jag3d or https://software.applied-geodesy.org to get the latest version. -
6
This is the official repository for the CUSTOMHyS-Qt software. CUSTOMHyS-Qt is a GUI for the CUSTOMHyS framework, which is an interactive tool for customysing heuristic-based algorithms. The CUSTOMHyS-Qt is written in Python and uses the PyQt5 library for the GUI. Further references about the backend can be found in the CUSTOMHyS repository.
-
7
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.
-
8
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.
-
9
Alcinoe
compoments suite for Delphi
Project description and support moved to : https://github.com/Zeus64/alcinoe However you can use the source you prefer, the SVN here or the GIT on github, both are synchronized (just that GIT don't support large file > 100 mo so some minor files used only as references are missing from GIT) -
When it comes to cybersecurity, what your clients don’t know can really hurt them. And believe it or not, keep them safe starts with asking questions. With ConnectWise Identify Assessment, get access to risk assessment backed by the NIST Cybersecurity Framework to uncover risks across your client’s entire business, not just their networks. With a clearly defined, easy-to-read risk report in hand, you can start having meaningful security conversations that can get you on the path of keeping your clients protected from every angle. Choose from two assessment levels to cover every client’s need, from the Essentials to cover the basics to our Comprehensive Assessment to dive deeper to uncover additional risks. Our intuitive heat map shows you your client’s overall risk level and priority to address risks based on probability and financial impact. Each report includes remediation recommendations to help you create a revenue-generating action plan.
-
10
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. -
11
Gemi
PCR primers / probes design from multiple & degenerate sequences
Gemi can be downloaded from the site (https://sites.google.com/site/haithamsobhy/software). Please, do not hesitate to contact Dr. Haitham Sobhy if you need help. Gemi, an automated, fast, and easy-to-use bioinformatics tool with a user-friendly interface to design primers and probes for polymerase chain reaction (PCR). Gemi accepts multiple aligned and long DNA and RNA sequences with degenerate nucleotide (non-A/C/G/T bases). Gemi can be used for quantitative, real-time and conventional... -
12
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.
-
13
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. If the app isn't running on Linux, go... -
14
BioNetExplorer
Framework for Exploration of Bio-signal Processing DNNs in Wearables
The BioNetExplorer framework systematically generates and explores multiple DNN architectures for bio-signal processing in wearable devices. Our framework varies key neural architecture parameters to search for an embedded DNN with low hardware overhead that can be deployed in wearable edge devices to analyze the bio-signal data and to extract the relevant information, such as arrhythmia and seizure. Furthermore, BioNetExplorer reduces the exploration time by deploying genetic algorithms... -
15
BP33
Creator of Bezier-PARSEC airfoils.
-
16
RGP Eugenics
Eugenics assumptions in genetic programing
Development of solutions in an automatic way using genetic programming and evolutionary algorithms is powerful. Assuming random starting point and following evolution principles we are capable to solve very complex problems. Question is what if we know some sub-optimal solutions and the evolution process will get so-called good start? The general purpose of the project is to get purely empirical answers for such question. -
17
SVPhylA
SVPhylA: Sequence Vectorization for Phylogenetic Analyses
SVPhylA is a python tool for the calculation of several alignment-free distances for phylogenetics analysis from the most popular alignment-free approaches. Such alignment-free methods basically encode DNA and protein sequences (fasta files) into numerical vectors allowing the calculation of alignment-free distances which may be combined into a consensus/compromise matrix by using algorithms like DISTATIS based on Multidimensional Scaling (MSD), Lineal Principal Component Analysis (PCA) and PCA... -
18
Skalli
IVS & ILRS Reference Point Determination
Skalli is a simple tool to estimate the IVS (International VLBI Service for Geodesy and Astrometry) and ILRS (International Laser Ranging Service) reference point of a radio or laser telescope. -
19
OpenDino
Open Source Java platform for Optimization, DoE, and Learning.
OpenDino is an open source Java platform for optimization, design of experiment 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... -
20
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. -
21
EECluster
Tool for energy-efficient resource management in HPC clusters
EECluster is software tool for managing the energy-efficient allocation of the cluster resources. EECluster uses a Hybrid Genetic Fuzzy System as the decision-making mechanism that elicits part of its rule base dependent on the cluster workload scenario, delivering good compliance with the administrator preferences. In the latest version, we leverage a more sophisticated and exhaustive model that covers a wider range of environmental aspects and balances service quality and power consumption... -
22
sijinn
SImple Java Implementation of Neural Network
Alfa version - work in progress. Perseptron network structure. Can be saved in xml format. Training strategies: - Gradient Descent (Batch, Stochastic) - Genetic Breeding Training algorithms: - BPROP (back propagation) - QPROP (quick propagation) - RPROP (resilient propagation) - GENE (genetic neural) Demo: https://sijinn.herokuapp.com/ http://sijinn.appspot.com/network GitHub: https://github.com/surban1974/sijinn Maven <repositories> <repository> <id>neohort-mvn-repo</id> <url>https... -
23
TEESer
Tool for Engineering Emergent Selforganizing bEhavioR
... their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information. -
24
miRBond
miRBond: Genome-scale identification of miRNA-mRNA and miRNA-lncRNA in
Domestic animals show considerable genetic diversity. Previous studies suggested that animal phenotypes were affected by miRNA-mRNA interplay, but these studies focused mainly on the analysis of one or several miRNA-mRNA interactions. Whereas in this study, we present miRNA-mRNA and miRNA-lncRNA interactions on genome scale by using the miRanda and TargetScan algorithms. There has been strong directional artificial selection practiced during the domestication of animals. Thus, we investigated... -
25
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. In contrast...