Search Results for "parallel genetic algorithm"
Sort By:
Showing 30 open source projects for "parallel genetic algorithm"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
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.
-
2
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.
-
3
Parallel MILC
Parallel decompression for the MILC algorithm
The MILC compression has been developed specifically for medical images and proven to be effective. This algorithm is a parallel version for the decompression phase, meant to exploit the parallel computing potential of the modern hardware. Developed with OpenCL framework (version 1.2), runs on CPU and GPU OpenCL devices. -
4
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."[*]. -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
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.)
-
6
Parallel Neural Networks
Neural networks in CUDA & OpenCL with back propagation algorithm
This project is my engineering diploma. It's aim is to compare the efficiency of both technologies and to check where which hacks works better. What is more one of my tasks is to compare different ways of decomposing computations in parallel. -
7
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. ... -
8
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... -
9
The parallelized FDTD Schrodinger Solver implements a parallel algorithm for solving the time-independent 3d Schrodinger equation using the finite difference time domain (FDTD) method. See the Hosted Apps > MediaWiki menu item for more information.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
11
texgenpack
Texture compression and conversion program with KTX and DDS support.
texgenpack is a texture compression and conversion program featuring a command line utility and a simple GUI program . Compression is implemented using a genetic algorithm. It supports compression, decompression, conversion and comparison of texture and image files. The image format supported is PNG, while for textures there is support for KTX, PKM and DDS using ETC1, ETC2, DXT1/3/5 or BPTC (BC7) texture compression. Several uncompressed texture format are also supported. This program requires the installation of libfgen, also avalable on SourceForge. -
12
Bouc-Wen-Baber-Noori model of hysteresis
Compute parameters of the Bouc-Wen-Baber-Noori model of hysteresis
..."A Fast and Elitist multi-objective Genetic Algorithm: NSGA-II". Journal IEEE Transactions on Evolutionary Computation (IEEE-TEC). 2002. Vol. 6. No. 2. pp. 182-197. - Gilberto A. Ortiz, Diego A. Alvarez, Daniel Bedoya-Ruiz. "Identification of Bouc-Wen type models using multi-objective optimization algorithms". Computers & Structures. Vol. 114-115. pp. 121-132. 2013. -
13
Alkindus is an automated solver for short monoalphabetic substitution ciphers without word divisions.
-
14
Developed as a final year project at Islamic University of Technology (IUT) during 2010 - 2011 academic year. This code is a simple implementation of real coded genetic algorithm for numerical optimization. Code is written in C/C++.
-
15
This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
-
16
Evolutionary Structural Optimization Package (ESOP) consists of software for viewing, analyzing, and optimizing structures containing beam, truss, and membrane plate elements utilizing OpenGL and the Genetic Algorithm (GA). Created for use in M.S. theses
-
17
This project implements the parallelized version of the LBG vector quantization algorithm on Cell Broadband Engine.
-
18
Searches for adecuate design for feedforward backpropagation neural network, employing genetic algorithm as refining engine. The result topolgy may not be orthodox.
-
19
czip is a unix based utility written for the cell broadband engine. It allows its users to compress files in gzip format. It uses Jean-loup Gailly's deflate algorithm and is based in part on pigz, Mark Adlers parallel version of zlib.
-
20
This project aims to create an application to solve the job shop schedule problem using genetic algorithm on the IBM Cell BE processor. This is useful especially using the power of Cell for the large scale job shop schedule problem.
-
21
This project is about an algorithm for multi-resolution texture systhesis on Cell.BE.There are there source code files.One is serial on x86.One is serial code on cell ppu,and the last is parallel code,which use ppu and 8 spus.
-
22
-
23
-
24
A flexible programming library for evolutionary computation. Steady-state, generational and island model genetic algorithms are supported, using Darwinian, Lamarckian or Baldwinian evolution. Includes support for multiprocessor and distributed systems.
-
25
NullAllEst is the implementation of a maximum likelihood algorithm to estimate the frequency of a null allele in microsatellite genetic data. A Markov Chain Monte Carlo simulation is used to solve the likelihood function.
