Search Results for "genetic algorithm c" - Page 14
Sort By:
Showing 1385 open source projects for "genetic algorithm c"
View related business solutions-
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.
-
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
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
...Newman, Physical Review E, 74(3):036104, 2006. [3] B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. It also makes of the classes available from Numerical Recipies 3rd Edition W. Press, S. Teukolsky, W. Vetterling, B. Flanne -
2
Sched-Resched
A C++ schedule generator based on Genetic Algorithm and Hill Climbing
Sched-Sched is a C++ schedule generator for software project staffing and rescheduling based on Genetic Algorithm (GA) and Hill Climbing (HC). It is implemented with GALib (http://lancet.mit.edu/ga/), an open-source toolkit of Genetic Algorithms in various platforms including Unix and Windows. The input and output files of the software are required as XML format. -
3
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. ... -
4
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. -
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
5
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. -
6
theoEA_Code
genetic algorithm for optimizing planar optical antennas
-
7
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... -
8
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.
-
9
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... -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
10
Genetic Programming Classifier is a distributed evolutionary data classification program. It uses the ensemble method implemented under a parallel co-evolutionary Genetic Programming technique.
-
11
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).
-
12
This code uses a technique originally developed for facial recognition to describe shear stress distributions in open channel flow. In this approach, a synthetic database of images representing normalized shear stress distributions is formed from the training data set using recurrence plot analysis. A face recognition algorithm is then employed to synthesize the recurrence plots and transform the original database into short-dimension vectors containing similarity weights proportional to the...
-
13
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.... -
14
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... -
15
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), -
16
...The package optimizes the function given a set of user-specified parameters, e.g., the domain manifold, algorithm, stopping criterion.
-
17
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
-
18
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. -
19
ShaSeSha
Implementations of Shamir's Secret Sharing algorithm
Javascript, Python, C++ implementations of Shamir's Secret Sharing algorithm. This is very much a work in progress, and while the functionality is there to split and join, it needs work, cleanup, documentation, profiling and testing. It is only provided in the hopes it may be useful. I make absolutely NO guarantees or warranties, not even of merchantability, either expressed or implied, and do not make any claims about the security or reliability of this project. ... -
20
Genetic Evolution Project
Evolution with Genetic algorithms
This project is meant to simulate Evolution using genetic algorithms and unity engine. -
21
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... -
22
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. -
23
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 -
24
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. -
25
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...
