Search Results for "genetic algorithm c" - Page 6
Sort By:
Showing 1013 open source projects for "genetic algorithm c"
View related business solutions-
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.
-
$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.
-
1
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.
-
2
MACE
Deep learning inference framework optimized for mobile platforms
Mobile AI Compute Engine (or MACE for short) is a deep learning inference framework optimized for mobile heterogeneous computing on Android, iOS, Linux and Windows devices. Runtime is optimized with NEON, OpenCL and Hexagon, and Winograd algorithm is introduced to speed up convolution operations. The initialization is also optimized to be faster. Chip-dependent power options like big.LITTLE scheduling, Adreno GPU hints are included as advanced APIs. UI responsiveness guarantee is sometimes... -
3
Qbsolv
A decomposing solver
Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.) -
4
WSClean
WSClean is a fast widefield interferometric imager
WSClean (w-stacking clean) is a fast generic widefield imager. It uses the w-stacking algorithm and can make use of the w-snapshot algorithm. As of Feb 2014, it is 2-12 times faster than CASA's w-projection, depending on the array configuration. It supports full-sky imaging and proper beam correction for homogeneous dipole arrays such as the MWA. WSClean allows Hogbom and Cotton-Schwab cleaning and has wideband, multiscale, compressed sensing and joined-polarization deconvolution modes.... -
Add Two Lines of Code. Get Full APM.Works out of the box for Rails, Django, Express, Phoenix, and more. Monitoring exceptions and performance in no time.
-
5
MAGeCK
Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout
Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout (MAGeCK) is a computational tool to identify important genes from the recent genome-scale CRISPR-Cas9 knockout screens technology. For instructions and documentations, please refer to the wiki page. MAGeCK is developed by Wei Li and Han Xu from Dr. Xiaole Shirley Liu's lab at Dana-Farber Cancer Institute/Harvard School of Public Health, and is maintained by Wei Li lab at Children's National Medical Center. We thank the support... -
6
levelup
A wrapper for abstract-leveldown compliant stores, for Node.js
...LevelDB supports arbitrary byte arrays as both keys and values, singular get, put and delete operations, batched put and delete, bi-directional iterators and simple compression using the very fast Snappy algorithm. LevelDB stores entries sorted lexicographically by keys. This makes the streaming interface of levelup - which exposes LevelDB iterators as Readable Streams, a very powerful query mechanism. The most common store is leveldown which provides a pure C++ binding to LevelDB. Many alternative stores are available such as level.js in the browser or memdown for an in-memory store. ... -
7
gml4gtk
small console GML or graphviz DOT graph viewer
directed graph layout program for GML (Graph-Markup-Language) graph or partial graphviz DOT graph -
8
Triangula
Generate high-quality triangulated and polygonal art from images
Generate high-quality triangulated and polygonal art from images. Triangula uses a modified genetic algorithm to triangulate or polygonate images. It works best with images smaller than 3000px and with fewer than 3000 points, typically producing an optimal result within a couple of minutes. For a full explanation of the algorithm, see this page in the wiki. You can try the algorithm out in your browser, but the desktop app will typically be 20-50x faster. ... -
9
Fastcoin (FST)
The fastest software-based online payment system
The fastest software-based online payment system RELEASE : v1.14.3.2 Fastcoin - Celebrating over eight years of fast & secure transactions. ------------------------------------------------------------------------ - Total coins will be 165,888,000. - 60 second block target (Modified in 2021) - Custom unique difficulty algorithm. - Retargets once every hour or 300 blocks. - Each block contains 32 coins which will be halved every year (or 2,592,000 blocks). - (Currently 2 coins... -
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
10
Upscale
This program is upscaling any image by a factor 2 using an algorithm
This program is upscaling any image by a factor 2 using an algorithm of cubic interpolation. You may need to install the following libraries to run the program, tqdm, itertools, and OpenCV. -
11
KISA Toolkit
Korea Internet & Security Agency's Cipher Suite written in Go
...The Korea Internet & Security Agency (KISA) is distributing source codes that you can easily use. South Korean National Standard Algorithms: • LSH Message digest algorithm. 256/512-bit hash value. • ARIA 128-bit Block cipher with 128/192/256-bit keys. • LEA 128-bit Block cipher with 128/192/256-bit keys. • SEED 128-bit Block cipher with 128/256-bit keys. • HIGHT 64-bit Block cipher with 128bit key. Cryptographic Functions: • Symmetric Encryption/Decryption • Hash Digest • CMAC (Cipher-based message authentication code) • HMAC (Hash-based message authentication code) • PBKDF2 (Password-based key derivation function 2) Copyright (c) 2020-2021 Pedro Albanese - ALBANESE Lab Visit: http://albanese.atwebpages.com -
12
asBezpch
Source code for efficiently rendering parametrically defined surfaces
Source code and generated images from my 1987 master's degree project: An Adaptive Subdivision Algorithm for the Display of Parametrically Defined Surfaces -
13
yafu
Automated integer factorization
Check yafu on github for the latest code. YAFU (with assistance from other free software) uses the most powerful modern algorithms (and implementations of them) to factor input integers in a completely automated way. The automation within YAFU is state-of-the-art, combining factorization algorithms in an intelligent and adaptive methodology that minimizes the time to find the factors of arbitrary input integers. Most algorithm implementations are multi-threaded, allowing YAFU to fully... -
14
LaPath
Learning Automata algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for... -
15
AcoPath
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. Development takes place at https://github.com/zfoxer/AcoPath -
16
mapska
The Murder Accountability Project's Serial Killer Algorithm
Algorithm: Copyright (c) 2010, 2016 and 2017 - Murder Accountability Project. License: GNU General Public License (GPL) version 3. -
17
PsoPath
Particle Swarm Optimization algorithm for the shortest path problem
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of Particle Swarm Optimization is the emulation of the social behaviour of, e.g., a flock of birds, as a stochastic optimisation method. Specifically, a particle is an entity representing a solution in the search space. Several particles cooperate... -
18
muditulib
a multi-dimensional tuning library
Muditulib, a multidimensional tuning library, is a library to be implemented (wholly or partly) in music production software. It consists of a core of C functions. Additionally, a Pure Data implementation is provided. This implementation consist of several classes to be used as a modular system. The library makes use of a multidimensional numerical pitch representation system, a variant of the very well-known one-dimensional MIDI note system. Ambitions for other implementations are very... -
19
clzw
Implementation of LZW compression algorithm in C
Simple, fast implementation of LZW (Lempel–Ziv–Welch) data compression algorithm in C. - Console encoder/decoder tools - OS independent - Could be used in embedded projects - Works with raw code-stream LZW features: - Hardcoded dictionary size - Variable code size - Code search is performed by hash table and embedded in dictionary linked lists (encoder) - No dynamic memory allocation -
20
Blackfriday
Blackfriday, a markdown processor for Go
...It is paranoid about its input (so you can safely feed it user-supplied data), it is fast, it supports common extensions (tables, smart punctuation substitutions, etc.), and it is safe for all utf-8 (unicode) input. HTML output is currently supported, along with Smartypants extensions. It started as a translation from C of Sundown. Blackfriday itself does nothing to protect against malicious content. If you are dealing with user-supplied markdown, we recommend running Blackfriday's output through HTML sanitizer such as Bluemonday. Blackfriday includes an algorithm for creating sanitized anchor names corresponding to a given input text. This algorithm is used to create anchors for headings when EXTENSION_AUTO_HEADER_IDS is enabled. ... -
21
bioweb
polyglot language framework to analyze genetic data
polyglot framework using Python/C++/JavaScript to fast develop applications to analyze biological sequences -
22
JDS: Data Security
JDS is a powerful data protection program
JDS is a powerful tool for data protection. Documents are encrypted using a special algorithm. The data encryption algorithm is constantly updated to improve security. The program also provides other functions. Such as sending a file to a vault with password access, fast text encryption in 3 types, and much more. The program is easy to use and does not require special knowledge. The standard version has 2 languages (Russian and English) and 9 themes. You can download the language... -
23
Base62 Encode/Decode Utility
A tool for encoding/decoding to base62
...the base62 program has been written to encode/decode files into this format. The syntax is similar to the popular base64 command line program. Inside the package there is a working c++ version of the base62 algorithm. the sources are inside the package. Note that from release 2.0.0 the algorithm is different from the one used before. If you have coded a file using base62 < 2.0.0 DO NOT USE base62 >= 2.0.0 to decode it. The 2.0.1 release has a new algorithm for chew, we have a compat flag -
24
Geophysical Library is a C++-library to handle geophysical data. At the moment the focus is on magnetotelluric and seismic data. It also includes a genetic algorithm for data inversion, signal processing and statistics routines.
-
25
Smart Algorithm
Repository implementing a variety of intelligent algorithms
Smart-Algorithm is a repository implementing a variety of intelligent / metaheuristic optimization algorithms (e.g. Genetic Algorithm, Ant Colony, Particle Swarm, Immune Algorithm). The implementations are provided in multiple languages (Java, Python, MATLAB). The repository’s aim is to offer reference implementations of “smart” algorithms for tasks like route planning, optimization, or algorithm learning.
