Search Results for "genetic algorithm cuda" - Page 3
Sort By:
Showing 265 open source projects for "genetic algorithm cuda"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
1
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."[*]. CUDA-quicksort is an iterative GPU-based implementation... -
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
The alignments to the genome from next-generation-sequencing (NGS) data cannot be directly used as input to the existing recombination detection (RD) algorithms that use multiple sequence alignments (MSA). 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... -
4
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.
-
Top-Rated Free CRM SoftwareHubSpot 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.
-
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... -
6
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. -
7
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79... -
8
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. -
9
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] -
The #1 Embedded Analytics Solution for SaaS Teams.Qrvey’s comprehensive embedded analytics software enables you to design more customizable analytics experiences for your end users.
-
10
CUDAlign
CUDAlign is a tool that aligns huge DNA sequences in CUDA capable GPUs
CUDAlign is a tool able to align pairwise DNA sequences of unrestricted size in CUDA GPUs, using the Smith-Waterman algorithm combined with Myers-Miller. It produces the optimal alignment of 1 million base sequences in 45 seconds using a GTX 560 Ti. Many optimizations are being developed for this software. Look at the following papers for detailed information: [1] Edans Sandes, Alba Melo. Retrieving Smith-Waterman Alignments with Optimizations for Megabase Biological Sequences using GPU. IEEE... -
11
Glycosylation Microviewer
An application create, simulate and adjust N-linked glycosylation.
Glycosylation Microviewer is an application that create N-linked glycosylation raction network. 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... -
12
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. User friendly GAMETES software... -
13
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). The code was written in C++, using MS Visual Studio 6.0... -
14
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. -
15
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... -
16
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. -
17
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).
-
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
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. -
20
Grammatical Optimization
A java based framework for grammatical evolution.
This project is a result for my curiosity for how grammatical evolution (GE) works. Eventually, I made this wrapper for GE that should work with any numerical optimization algorithm. So the idea behind GE is that it takes production rules for computer programs using a context free grammar in Backus Naur form. The production rules can be used to evolve computer programs by running an algorithm such as a genetic algorithm or a particle swarm optimizer in the background. -
21
FamSeq
Variant calling on the basis of pedigree information
... 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. -
22
SimpleFB_GA
a simple genetic algorithm written in FreeBasic
a FreeBasic-written Genetic Algorithm code is here deployed -
23
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. -
24
HfT GA RCPSP
Genetic Algorithm for the RCPSP
-
25
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). It has...