Search Results for "genetic algorithm c" - Page 11
Sort By:
Showing 1013 open source projects for "genetic algorithm c"
View related business solutions-
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
1
Attitude Estimator
A C++ implementation of a nonlinear 3D IMU fusion algorithm.
Attitude Estimator is a generic platform-independent C++ library that implements an IMU sensor fusion algorithm. Up to 3-axis gyroscope, accelerometer and magnetometer data can be processed into a full 3D quaternion orientation estimate, with the use of a nonlinear Passive Complementary Filter. The library is targeted at robotic applications, but is by no means limited to this. Features of the estimator include gyro bias estimation, transient quick learning, multiple estimation algorithms, tuneable estimator parameters, and near-global stability backed by theoretical analysis. ... -
2
Sched-SPM
A C++ schedule generator based on Genetic Algorithm and Hill Climbing
Sched-SPM is a C++ schedule generator for software project staffing and rescheduling based on Genetic Algorithm (GA) and Hill Climbing (HC). This preliminary tool is mainly for academic purpose. It is implemented with GALib (http://lancet.mit.edu/ga/), an open-source toolkit of Genetic Algorithms in various platforms including Unix and Windows. -
3
E-Reader
Extreem Reader for Cosmological simulation data P-Gadet2 and ART codes
Extreem Reader for Cosmological simulation data P-Gadet2 and ART codes.It conserves memory by using memory mapped files. Contains some basic analysis tools such a KD-Tree, Minimum Spanning Tree, and rendering module using PMViewer algorithm. -
4
theoEA_Code
genetic algorithm for optimizing planar optical antennas
-
Our Free Plans just got better! | Auth0You 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 security. Auth0 now, thank yourself later.
-
5
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary... -
6
This is a refactored C++ version of subroutine dqelg of QUADPACK, an implementation of the epsilon table extrapolation algorithm, originally written in Fortran 77. This version is expected to exactly reproduce the roundoff errors of dqelg. Declarations for standard-conforming Fortran bindings are also provided.
-
7
Photon4K
32768-bit symmetric-key encryption, fully-functional development CLI
Photon4K is a 32768-bit symmetric-key encryption cipher accessed via a basic, yet fully-functional development-oriented Command Line Interface (CLI) utility. The algorithm is intended to be a high-security "symmetric" cipher designed primarily for archival purposes -- http://wikipedia.org/wiki/Symmetric-key_algorithm . Photon4K is implemented as an attempt to take long-established, proven cryptographic techniques to another "level" to contend with the rapid advances in powerful... -
8
Genetic Programming Classifier is a distributed evolutionary data classification program. It uses the ensemble method implemented under a parallel co-evolutionary Genetic Programming technique.
-
9
ekpar2 (Easy Par2 for KDE) is a tool to create par2 recovery sets for one or more source files, verify and repair these source files. It has an easy to use gui for KDE (aimed to look and feel like the windows tool QuickPar). Par2 (or Parchive) is a set of recovery files that holds error correction information for one or more source files using the Reed Solomon algorithm (see parchive on SourceForge).
-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
ooPorter
A Porter stemming or stemmer algorithm coded in ooRexx
This is an ooRexx line-by-line port from Ansi-C to ooRexx of the stemming routine published by Martin Porter 1980. The original source code from Porter has been commented out and emulated by the corresponding (oo)Rexx code as far as possible. This is not an example of good or fast (oo)Rexx programming, it is merely a demonstration of the Porter stemming routine ported to ooRexx, use and modify as necessary. Input to the program is a textfile with words to be stemmed, one per line.... -
11
MULTOVL
Multiple overlaps of genomic regions
The MULTOVL suite of programs finds multiple overlaps among genomic regions. The MULTOVL algorithm can detect several kinds of region overlaps. In addition to the N-fold overlaps you can detect solitary regions which are the input regions that do not overlap with any other region in the input data set, and union overlaps that is the union of the input regions that overlap at least once somewhere. IMPORTANT NOTICE: MULTOVL has been migrated to BitBucket. Please refer to the MULTOVL website... -
12
erne
ERNE - Extended Randomized Numerical alignEr
We present ERNE (Extended Randomized Numerical alignEr), a short string alignment package whose goal is to provide an all-inclusive set of tools to handle short (NGS-like) reads. ERNE comprises ERNE-FILTER (read trimming and continamination filtering), ERNE-MAP (core alignment tool/algorithm), ERNE-BS5 (bisulfite treated reads aligner), and ERNE-PMAP/ERNE-PBS5 (distributed versions of the aligners), -
13
This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation
-
14
MSAProbs: Multiple Sequence Alignment
One of the most accurate multiple protein sequence aligners
MSAProbs is an open-source protein multiple sequence ailgnment algorithm, achieving the stastistically highest alignment accuracy on popular benchmarks: BALIBASE, PREFAB, SABMARK, OXBENCH, compared to ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. -
15
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for... -
16
skewer
A fast and sensitive adapter trimmer for illumina paired-end sequences
This program implements a novel dynamic programming algorithm dedicated to the task of adapter trimming and it is specially designed for processing illumina paired-end sequences. -
17
C/C++ Neural Networks
A C API for working with Neural Networks
A free C library for working with FeedForward Neural Networks, Neurons and Perceptrons -
18
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. -
19
Parallel Quicksort with MPI
Parallel Quicksort with MPI
Sorting is used in human activities and devices like personal computers, smart phones, and it continues to play a crucial role in the development of recent technologies. The QuickSort algorithm has been known as one of the fastest and most efficient sorting algorithm. It was invented by C.A.R Hoare in 1961and is using the divide-and-conquer strategy for solving problems [3]. Its partitioning aspects make QuickSort amenable to parallelization using task parallelism. MPI is a message passing... -
20
iCAS - An Illumina Clone Assembly System
An Illumina clone assembly system using SOAPdenovo and ABySS
Clone-by-clone sequencing, as a means of achieving high quality assemblies for large and complex genomes, continues to be of great relevance in the era of high throughput sequencing. However, assemblies obtained using current whole genome assemblers are often fragmented and sometimes have issues of genome completeness owing to different data characteristics introduced by multiplexed sequencing. With iCAS the data filtering process is based on a novel kmer frequency algorithm, resulting... -
21
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. -
22
Morpheus search algorithm
a mass spectrometry–based proteomics database search algorithm
...It is written in C# and is available open source under the permissive MIT License. -
23
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.
-
24
PortOpt
A portfolio-optimizer using Markowitz(1952) mean-variance model
PortOpt [Portfolio Optimizer] is a C++ program (with Python binding) implementing the Markowitz(1952) mean-variance model with agent's linear indifference curves toward risk in order to find the optimal assets portfolio under risk. You have to provide PortOpt (in text files or - if you use the api - using your own code) the variance/covariance matrix of the assets, their average returns and the agent risk preference. -
25
SFS_CODE (Selection on Finite Sites under COmplex Demographic Events) performs forward population genetic simulations under a general Wright-Fisher model with arbitrary demographic, selective, and mutational effects.
