Search Results for "parallel genetic algorithm" - Page 3
Sort By:
Showing 179 open source projects for "parallel genetic algorithm"
View related business solutions-
Outbound sales softwareAdversus is an outbound dialing solution that helps you streamline your call strategies, automate manual processes, and provide valuable insights to improve your outbound workflows and efficiency.
-
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.
-
1
Parallel Quicksort with MPI
Parallel Quicksort with MPI
...The main aim of this study is to implement the QuickSort algorithm using the Open MPI library and therefore compare the sequential with the parallel execution. -
2
GA-EoC
GeneticAlgorithm-based search for Heterogeneous Ensemble Combinations
...To enhance classification performances, we propose an ensemble of classifiers that combine the classification outputs of base classifiers using the simplest and largely used majority voting approach. Instead of creating the ensemble using all base classifiers, we have implemented a genetic algorithm (GA) to search for the best combination from heterogeneous base classifiers. The classification performances achieved by the proposed method method on the chosen datasets are promising. -
3
REDHORSE
Software suite for the analysis of haploid hybrids using NGS
...We therefore designed a software suite called REDHORSE that takes genomic alignments as input, extracts meaningful markers and generates MSAs that are the inputs to existing RD algorithms. In addition, REDHORSE implements a custom RD algorithm that makes use of sequence information and genomic positions to accurately detect crossovers. REDHORSE is portable and platform independent suite that provides efficient analysis of genetic crosses based on NGS data. -
4
GeneticAlgorithms
Framework for using the Genetic Algorithms optimization heuristic.
GeneticAlgorithms is a simple and lightweight framework to implement an optimization heuristic following the Genetic Algorithms model. A genetic algorithm mimics the natural processes of evolution, selection and "survival of the fittest". This framework is intuitive and good integrated with Java 1.5 SDK and later. -
Turn traffic into pipeline and prospects into customersDocket is an AI-powered sales enablement platform designed to unify go-to-market (GTM) data through its proprietary Sales Knowledge Lake™ and activate it with intelligent AI agents. The platform helps marketing teams increase pipeline generation by 15% by engaging website visitors in human-like conversations and qualifying leads. For sales teams, Docket improves seller efficiency by 33% by providing instant product knowledge, retrieving collateral, and creating personalized documents. Built for GTM teams, Docket integrates with over 100 tools across the revenue tech stack and offers enterprise-grade security with SOC 2 Type II, GDPR, and ISO 27001 compliance. Customers report improved win rates, shorter sales cycles, and dramatically reduced response times. Docket’s scalable, accurate, and fast AI agents deliver reliable answers with confidence scores, empowering teams to close deals faster.
-
5
libCudaOptimize
A Parallel Optimization library with CUDA
LibCudaOptimize is a GPU-based open source library that allows you to run state-of-the-art bio-inspired optimization heuristics in parallel to optimize a fitness function, introduce a new optimization algorithm, or easily modify/extend existing ones. -
6
Java CoreWars Evolver
A Java based, pMars compatible, CoreWars simulator with GA
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial] -
7
COMRAD-MPI
Compression of Large Genomic Datasets using Parallel Computing
COMRAD-MPI is a parallel computing algorithm for reducing the computational time for compressing the large genomic data sets based on COMRAD algorithm. It captures the long range repeat redundancies in large genomes there by providing a way to compress the large DNA data set. Three stages- Substitution, Clean up and Huffman encoding have been parallelized using message passing library. -
8
gametes
Generate complex SNP models and heterogeneous datasets
Genetic Architecture Model Emulator for Testing and Evaluating Software (GAMETES) is an algorithm for the generation of complex single nucleotide polymorphism (SNP) models for simulated association studies. GAMETES is designed to generate epistatic models which we refer to as pure and strict, that constitute the worst-case in terms of detecting disease associations, since such associations may only be observed if all n-loci are included in the disease model. -
9
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.)
-
Data management solutions for confident marketingVerify, deduplicate, manipulate, and assign records automatically to keep your CRM data accurate, complete, and ready for business.
-
10
fPotencia
Power flow library in C++
fPotencia is the fruit of free time and passion for power systems simulation. After observing the lack of ready-to-implement libraries for power system analisys, and that the existing ones focus on command line workflow, I decided myself to start a project to fill the gap. Since Power system simulations have started needing to be executed in parallel, the old C-like designs are outdated; modular design is now needed to launch many simulations at the same time based on a base... -
11
Evolutionary Nursery
A simple genetic algorithm for numerical optimization
Evolutionary nursery is a result for my passion for developing genetic algorithms. I implemented this simple GA in 2008. This is especially intended for numerical optimization problems. -
12
Genetic Programming in OpenCL is a parallel implementation of genetic programming targeted at heterogeneous devices, such as CPU and GPU. It is written in OpenCL, an open standard for portable parallel programming across many computing platforms.
-
13
FamSeq
Variant calling on the basis of pedigree information
...FamSeq accommodates de novo mutations and can perform variant calling at chromosome X. To accommodate variations in data complexity, FamSeq consists of three distinct implementations of the Mendelian genetic model: the Bayesian network algorithm, Elston-Stewart algorithm and Markov chain Monte Carlo algorithm. To make the software efficient and applicable to large families, we parallelized the Bayesian network algorithm that copes with pedigrees with inbreeding loops without losing calculation precision on an NVIDIA® graphics processing unit. -
14
Ezys
Ezys 3D medical image registration program
Ezys is a non-linear 3D medical image registration program. Ezys fully exploits the parallel computing power of inexpensive commercial graphics processing units (GPU), resulting in a very fast and accurate program capable of running on desktop PCs and even some laptops. On these systems, non-linear image registrations take less than a minute to complete. Ezys implements a diffeomorphic inverse consistent image registration algorithm with a demons-style regularization based on a non-parametric free form deformation model. ... -
15
NEAT Visualizer SFML
A NEAT Implementation and Visualization System
Evolves neural networks using the Neuro-Evolution of Augmenting Topologies (NEAT) technique. A separate visualization system uses another genetic algorithm to evolve images of the otherwise dimensionless networks so their structure can be observed. -
16
niGA
Heterogenous Multiprocessor Scheduling Using Genetic Algorithms
Implementation of task scheduling using Genetics algorithm for heterogeneous parallel programming -
17
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. ... -
18
VariantMaster
Extract causative variants for monogenic and sporadic genetic diseases
...To improve the identification of the variants from HTS, we developed VariantMaster, an original program that accurately and efficiently extracts causative variants in familial and sporadic genetic diseases. The algorithm takes into account predicted variants (SNPs and indels) in affected individuals or tumor samples and utilizes the row (BAM) data to robustly estimate the conditional probability of segregation in a family, as well as the probability of it being de novo or somatic. In familial cases, various modes of inheritance are considered: X-linked, autosomal dominant, and recessive (homozygosity or compound heterozygosity). ... -
19
ALCHEMY is a genotype calling algorithm for Affymetrix and Illumina products which is not based on clustering methods. Features include explicit handling of reduced heterozygosity due to inbreeding and accurate results with small sample sizes
-
20
Evochumps
Evolving recursive artificial neural networks in a simulation.
...It has a built-in evolutionary algorith to let the brains evolve conditoned to selective pressure. The program's interface allows you to manipulate all kinds of parameters of both the simulation, the genetic algorithm, and each particular RNN in real time. -
21
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. -
22
The sequence alignment task in MAGI (magi.ucsd.edu) is based on the miRanda algorithm, but we redesign the miRanda algorithm on GPU by taking its advantages of massively parallel computing and extra high memory bandwidth using using NVIDIA’s Compute Unified Device Architecture (CUDA). The CUDA-miRanda implementation is a fast microRNA target identification algorithm that aligns short nucleotide sequences (i.e., < 32 nucleotides) against longer reference sequences (e.g., 20k nucleotides). ...
-
23
GENIE (GEne-geNe IntEraction)
GPU based Parallel Gene-Gene Interaction Analysis
Gene-gene interaction in genetic association studies is computationally intensive when a large number of SNPs are involved. Most of the latest Central Processing Units (CPUs) have multiple cores, whereas Graphics Processing Units (GPUs) also have hundreds of cores and have been recently used to implement faster scientific software. However, currently there are no genetic analysis software packages that allow users to fully utilize the computing power of these multi-core devices for genetic... -
24
ABM-Calibration-SensitivityAnalysis
Codes and Data for Calibration and Sensitivity Analysis of ABM
...<http://jasss.soc.surrey.ac.uk/xx/x/x.html> Methods/Techniques used are: a. Parameter fitting: 1. Full Factorial Design 2. Simple Random Sampling 3. Latin Hypercube Sampling 4. Quasi-Newton Method 5. Simulated Annealing 6. Genetic Algorithm 7. Approximate Bayesian Computation b. Sensitivity Analysis: 1. Local SA 2. Morris Screening 3. DoE 4. Partial (Rank) Correlation Coefficient 5. Standardised (Rank) Regression Coefficient 6. Sobol' 7. eFAST 8. FANOVA Decomposition Have also a look on our other projects: http://www.uni-goettingen.de/de/315075.html -
25
gpgmpi
An GPGMP in C++/OpenCL with improved time step algorithm
The need for speed is always a challenge for large-scale stochastic simulation. This software is based on a parallel stochastic simulation algorithm already implemented on Graphics Processing Unit (GPU) for inhomogeneous reaction-drift-diffusion systems. We suggest an improved choice of time step which turns out to be almost 3 or even more times fast with nearly identical accuracy. The software is now completely implemented in C++ and OpenCL which only depends on boost library and GPU vendor’s OpenCL SDK. ...
