Search Results for "parallel genetic algorithm" - Page 4
Sort By:
Showing 319 open source projects for "parallel genetic algorithm"
View related business solutions-
Skillfully - The future of skills based hiringSkillfully transforms hiring through AI-powered skill simulations that show you how candidates actually perform before you hire them. Our platform helps companies cut through AI-generated resumes and rehearsed interviews by validating real capabilities in action. Through dynamic job specific simulations and skill-based assessments, companies like Bloomberg and McKinsey have cut screening time by 50% while dramatically improving hire quality.
-
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.
-
1
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. -
2
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. -
3
This software searches the potential energy surface of small to medium size atomic systems for global minima using quantum ab initio techniques. It performs bond rotations and molecule translations and rotations on a Linux cluster with MPI.
-
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. -
The Most Powerful Software Platform for EHSQ and ESG ManagementChoose from a complete set of software solutions across EHSQ that address all aspects of top performing Environmental, Health and Safety, and Quality management programs.
-
5
BiRW
Bi-random Walks for Phenome-Genome Association Prediction
The availability of ontologies and systematic documentations of phenotypes and their genetic associations has enabled large-scale network-based global analyses of the association between the complete collection of phenotypes (phenome) and genes. BiRW is a package designed for analysis and prediction of the phenome-genome associations. BiRW package contains a program for analysis of circular bigraphs (CBGs) and the bi-random walk (BiRW) algorithm to capture the CBG patterns in the networks for unveiling human and mouse phenome-genome association. ... -
6
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. -
7
CUDA-Quicksort
CUDA-Quicksort: A GPU-based implementation of the quicksort algorithm
CUDA-quicksort is a GPU-based implementation of the quicksort algorithm. CUDA-quicksort is designed to exploit the power computing of modern NVIDIA GPUs. "Two GPU-based implementations of the quicksort were presented in literature: the GPU-quicksort, a compute-unified device architecture (CUDA) iterative implementation, and the CUDA dynamic parallel (CDP) quicksort, a recursive implementation provided by NVIDIA Corporation."[*]. -
8
SuperAlign was fully updated as of 15 July 2013 and is now released under the name eAlign as well. A parallel corpora (bitext) aligning tool. Create TMX databases and align translations for Translation Memory databases. Use multiple files in multiple formats to align them with their translations. The full workflow is built in with a GUI interface. SuperAlign-eAlign uses the hunalign algorithm.
-
9
SWAPHI-LS: Alignment on Xeon Phi Cluster
Smith-Waterman long DNA sequence alignment on Xeon Phi clusters
The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host. -
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.
-
10
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] -
11
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. -
12
SWAPHI: Smith-Waterman on Intel Xeon Phi
The first protein sequence database search on shared-host Xeon Phis
The first parallel algorithm to accelerate the Smith-Waterman protein database search on shared-host multiple Intel Xeon Phi coprocessors. By searching against the UniProtKB/TrEMBL database, SWAPHI achieves a performance of up to 58.8 billion cell updates per second (GCUPS) on a single Xeon Phi and up to 228.4 GCUPS on four Xeon Phis. -
13
diggit
R package for DIGGIT algorithm
DIGGIT identify genetic variants associated with drivers of specific physiopathologic states. I computes the statistical association between the presence of genetic variants (CNV or SNP) and the activity of proteins driving physiologic or pathologic phenotype. It requires large gene expression and genetic variants datasets and depends on context-specific regulatory networks including transcriptional interactomes (usually reverse engineered by the ARACNe algorithm) and post-translational interactomes (usually generated by the MINDy algorithm). ... -
14
CUDAlign
CUDAlign is a tool that aligns huge DNA sequences in CUDA capable GPUs
...IEEE Transactions on Parallel and Distributed Systems, vol. 99, PrePrints, 2012 [2] Edans Sandes, Alba Melo. Smith-Waterman Alignment of Huge Sequences with GPU in Linear Space. IPDPS 2011: 1199-1211 [3] Edans Sandes, Alba Melo. CUDAlign: using GPU to accelerate the comparison of megabase genomic sequences. PPOPP 2010: 137-146 The latest source code can be found in Github. -
15
Glycosylation Microviewer
An application create, simulate and adjust N-linked glycosylation.
...The model used in the application is based on two significant papers: 1.1997 Pablo Umana, James E.Bailey A Mathematical Model of N-linked Glycoform Biosynthesis. 2.2005 Frederick J.Krambeck, Michael J.Betenbaugh A Mathematical Model of N-linked Glycosylation. The application allow to simulate the network in dynamic form with various ODE solvers(Euler, Runge-Kutta etc). Genetic Algorithm is used to adjust the kinetic parameters of Michaelis-Menten equations in glycosylation reaction network. A dynamic plot is supplied to show the value of mole amout and mole fraction of various glycoform. Thanks to Alexey Balakin and Alessandro Presta. Alexey Balakin supply mathgl(https://sourceforge.net/projects/mathgl) that make the implementation of dynamic plot in this application easily. ... -
16
Cyberphantom Alfa Colony
AI new tipe
This is an experimental project whose main objective is the creation of artificial intelligence (AI) new tipe. At the core of this idea is the use of special genetic algorithm that emulates the single-celled organism. The colony of such cybernetic organisms can give rise to a "reasonable" network that have a huge intellect and computing power. -
17
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. -
18
quickGA-m
A quick (messy?) genetic algorithm to solve TSP
A quick genetic algorithm to solve TSP scenarios. Written in Matlab. Circa June 2012. -
19
Genetic Algorithms Engine - Blackjack
A genetic algortihm engine that evolves blackjack basic strategy.
This project is a genetic algorithm engine able to be reused for other projects with minimal additional programming. The genetic algorithm engine currently plays many blackjack hands for the fitness function and produces a result similar to blackjack basic strategy. To see it in action, download the zip file and run either: GABlackjack_Demo.exe (quick) or GABlackjack_Long.exe (slow, but it achieves better results). -
20
EurekaOptima is a framework for optimization containing the implementation of several algorithms like Genetic Algorithm (GA), Clonal Selection Algorithm (CLONALG), Grammatical Evolution (GE), Differential Evolution (DE), and Evolution Strategy (ES).
-
21
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.)
-
22
ESTReMo
An evolutionary simulator of transcription regulatory networks
ESTReMo is a genetic algorithm-based simulator to explore the evolution of transcription factors and their binding motifs on realistic genomic backgrounds. -
23
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... -
24
graph mapping distance matrix generator
parallel REAFUM code
We propose a parallel algorithm to do representative approximate frequent subgraph mining based on the REAFUM algorithm in this project. We successfully apply Fork-Join Model to our algorithm and parallelize the calculations on the generation of graph mapping distance matrix. Our algorithm guarantees identical results with REAFUM given same input while achieving significant improvements in runtime when running with multi-threads. -
25
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.
