Search Results for "genetic algorithm c" - Page 12
Sort By:
Showing 1385 open source projects for "genetic algorithm c"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
1
haveged is a daemon that feeds entropy into the linux /dev/random pool using a random number generator based upon the HArdware Volatile Entropy Gathering and Expansion algorithm.
-
2
JILRuntime/JewelScript
An object-oriented script language to embed in any application
A general purpose, object-oriented script language that compiles into code for a register based virtual machine. The language is quite similar to object-oriented high-level languages like Java and C#. The library is entirely self-sufficient and ANSI C compliant. It's main purpose is to be embedded in any application to allow automation of that application through scripting. An integrated C++ binding code generator allows you to create bindings for your application's classes in seconds.... -
3
NiceHash Miner
NiceHash easy to use CPU & GPU miner
NiceHash Miner is an easy to use CPU & GPU cryptocurrency miner for Windows. With a simple an intuitive graphical user interface it allows you to quickly turn your PC, workstation or server into money-making cryptocurrency mining machine. Why leave your computer idle, whereas it could earn you Bitcoins with just a few clicks? NiceHash Miner is essentially the only tool a miner needs. No need to go through tons of configuration files, various mining software versions, configuration tuning... -
4
Solid Python
A comprehensive gradient-free optimization framework written in Python
Solid is a Python framework for gradient-free optimization. It contains basic versions of many of the most common optimization algorithms that do not require the calculation of gradients, and allows for very rapid development using them. -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
Chronological Cohesive Units
The experimental source code for the paper
The experimental source code for the paper, "A Novel Recommendation Approach Based on Chronological Cohesive Units in Content Consuming" -
6
Shortest Path Graph A star
finds the sortest path on the directed graph using A* algorithm.
It is the implementation of the A* algorithm for directed graph. Additionally, the implementation of the Graph is provided. For visualization of the graph and the results of the A* algorithm the data are exported in GraphViz (Graph Visualization Software) format: http://www.graphviz.org/ Various exemplary solutions are provided. See also my other two projects related to A* algorithm: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/a-star/ -
7
file digest
A command-line utility for calculating and verifying file checksums.
Digest is a command-line utility which can be used to calculate and verify checksums of any files, similar to md5sum or RHash, but using modern hash algorithms. Supported algorithms: BLAKE, BLAKE2, Grøstl, JH, Kupyna, MD5, SHA-1, SHA-2, SHA-3, Skein, SM3, Streebog, Whirlpool. Usage: digest [-c] <algorithm> <filename(s)> For example, if you want to calculate the checksums using skein512/256 algorithm, use this command: digest skein512/256 * > checksums.skein To verify the checksums: digest -c skein512/256 checksums.skein You can get a full list of supported algorithms and test the performance of different algorithms on your PC using the command: digest test <iterations> <filename> This will calculate hash sum of <filename> multiple times (number of times is specified by <iterations>) and output the results with precise timings. ... -
8
KMC-KaiC
Kinetic Monte Carlo simulation of the in-vitro Kai Circadian clock
This code is a dedicated Kinetic Monte Carlo (KMC) algorithm which simulates a model of the post-translational Kai circadian clock. The code allows you to simulate the Kai system at the level of individual KaiC hexamers and monomers and explicitly tracks the turnover of every ATP nucleotide. Apart from ATP hydrolysis, all reactions obey detailed balance. The application of the code is described in our article titled "A Thermodynamically consistent model of the post-translational Kai... -
9
casync
Content-addressable data synchronization tool
A combination of the rsync algorithm and content-addressable storage. An efficient way to store and retrieve multiple related versions of large file systems or directory trees. An efficient way to deliver and update OS, VM, IoT and container images over the Internet in an HTTP and CDN friendly way. Let's take a large linear data stream, split it into variable-sized chunks (the size of each being a function of the chunk's contents), and store these chunks in individual, compressed files in... -
Forever Free Full-Stack Observability | 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.
-
10
Path Finder Qt
finds the sortest path on the square board. GUI is implemented in Qt.
The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics... -
11
RElt
calculates overlap, kinetic integrals for numerical atomic orbitals.
The efficient algorithm calculating the overlap and the kinetic integrals for the numerical atomic orbitals is implemented. The described algorithm exploits the properties of the prolate spheroidal coordinates. The overlap and the kinetic integrals in R^3 are reduced to the integrals over the rectangular domain in R^2, what substantially reduces the complexity of the problem. We prove that the integrand over the rectangular domain is continuous and does not have any slope singularities. For... -
12
CUBiBit
Tool to search binary biclusters on CUDA-enabled GPUs
...This tool receives as input a file with ARFF extension that contais the binary values of m attributes and n samples and returns a file with the biclustering information. It is able to exploit the parallel capabilities of manycore NVIDIA GPUS. It also makes use of C++11 multithreading support to accelerate one phase of the algorithm on several CPU cores. -
13
Machine Learning:Perceptron
Minimal version of the perceptron algorithm.Coded the simpler way.
A minimal version of the perceptron algorithm is implemented in C#. Coded for ease of understanding the referred to algorithm. Enter your info-press the learn button-then type in new info which the program will try and recognnise. There are some typos in the text displayed-but the code is correct. -
14
cfPred
Chou & Fasman algorithm implemented using C language.
Chou & Fasman algorithm implemented using C language. It is a CUI tool used for protein secondary structure prediction. -
15
GenCodeGenerator
C++ class to generate biologically plausible genetic codes
The "GeneticCode" C++ class is designed to generate versions of the genetic code subject to the requirements of the three major models of the genetic code origin and evolution (about these models see, e.g., Koonin & Novozhilov, 2009, IUBMB Life). This class was written specifically to perform statistical test for the paper Makukov & shCherbak (2017), but it might be used for a wider class of studies related to the genetic code. -
16
Bolt ML
10x faster matrix and vector operations
Bolt is an open-source research project focused on accelerating machine learning and data mining workloads through efficient vector compression and approximate computation techniques. The core idea behind Bolt is to compress large collections of dense numeric vectors and perform mathematical operations directly on the compressed representations instead of decompressing them first. This approach significantly reduces both memory usage and computational overhead when working with... -
17
Elements of Programming Interviews
Method stubs and test cases for Elements of Programming Interviews
This repository contains method stubs and tests of the problems from Elements Of Programming Interviews by Adnan Aziz, Tsung-Hsien Lee, and Amit Prakash. This book is also available in Python and C++. This repository contains solutions to problems from the book "Elements of Programming Interviews," focusing on interview preparation and algorithm practice. -
18
Swift AI
The Swift machine learning library
Swift AI is a high-performance deep learning library written entirely in Swift. We currently offer support for all Apple platforms, with Linux support coming soon. Swift AI includes a collection of common tools used for artificial intelligence and scientific applications. A flexible, fully-connected neural network with support for deep learning. Optimized specifically for Apple hardware, using advanced parallel processing techniques. We've created some example projects to demonstrate the... -
19
faif
C++ header only library with AI and bioinformatics algorithms
C++ header only library, small and fast; Naive Bayesian Classifier, Decision Tree Classifier (ID3), DNA/RNA nucleotide second structure predictor, timeseries management, timeseries prediction, generic Evolutionary Algorithm, generic Hill Climbing algorithm and others. -
20
A star
it is an implementation of A* algorithm with examples of its usage.
A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm -
21
GAKNN is a data mining software for gene annotation data. GAKNN is built with k- Nearest Neighbour algorithm optimized by the genetic algorithm. Gene annotation datasets saved under .csv or .arff formats with Gene Ontology or FunCat categorization can use GAKNN to predict gene functions.
-
22
GA-tools
general genetic algorithms optimization fortran 95 routines
High level optimization routines in Fortran 95 for optimization problems using a genetic algorithm with elitism, steady-state-reproduction, dynamic operator scoring by merit, no-duplicates-in-population. Chromosome representation may be integer-array, real-array, permutation-array, character-array. Single objective and multi-objective maximization routines are present. Possible to incorporate own crossover and mutation operators exclusively or in addition to standard operators that are included by default. ... -
23
IPAS for protein sequences
multiple alignment algorithm for protein sequences
IPAS is a new and practial protein multiple sequence alignment algorithm based on iterative progresive alignment algorithm Assessed on BAliBASE 3.0, PREFAB 4.0, SABMARK 1.65, and OXBENCH, MSAProbs achieves the statistically highest alignment accuracy, compared to ClustalW 2.0.10, MAFFT 6.717( using L-INS-i with --maxiterate = 1000), MUSCLE 3.8.31, ProbCons 1.12, and Probalign 1.3. -
24
QSdpR
Viral Quasispecies Reconstruction software based on QSdpR algorithm
This is a viral quasispecies reconstruction software for quasispecies assembly problem on mRNA viruses, which is based on a correlation clustering approach and uses semidefinite optimization framework. The software accepts a reference genome, a NGS read set aligned to this reference and set of SNP locations in the form of a vcf file and outputs an optimal set of reconstructed species genomes which describes the underlying viral population. -
25
Advanced Onion Router is a portable client for the OR network and is intended to be an improved alternative for Tor+Vidalia+Privoxy bundle for Windows users. Some of the improvements include UNICODE paths, support for HTTP and HTTPS proxy protocols on the same Socks4/Socks5 port with HTTP header filtering that generates fake identity-dependent headers every time the identity is changed (proxy chains are also supported), support for NTLM proxies, a User Interface that makes Tor's options and...
