Search Results for "algorithm"
Sort By:
Showing 141 open source projects for "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.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
1
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
2
CUTLASS
CUDA Templates for Linear Algebra Subroutines
CUTLASS is a collection of CUDA C++ template abstractions for implementing high-performance matrix-multiplication (GEMM) and related computations at all levels and scales within CUDA. It incorporates strategies for hierarchical decomposition and data movement similar to those used to implement cuBLAS and cuDNN. CUTLASS decomposes these "moving parts" into reusable, modular software components abstracted by C++ template classes. These thread-wide, warp-wide, block-wide, and device-wide... -
3
CRC RevEng
Arbitrary-precision CRC calculator and algorithm finder
CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. -
4
HungarianAlgorithm
An Ada implementation of the Hungarian Algorithm to minimize cost
The Hungarian algorithm can be described as optimally solving a workers versus jobs assignment problem that minimizes total cost. This implementation assumes a square cost matrix, i.e. the number of jobs equals the number of workers to do them. -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
Fractal Zoomer
A Fractal Zoomer with various functions.
An application that lets you render some of the most known fractal functions, like the Mandelbrot set and many more! It comes with alot of options to further enhance your fractal experience! Its easy to use and does not require installation. A java version higher than 1.8 is required to be installed. -
6
We implement a fast version of Frommers Algorithm to calculate the focal values of a plane autonomous system over a finite field. Documentation and experiment database can be found at http://www.centerfocus.de
-
7
calc: C-style arbitrary precision system
Calc: arbitrary precision C-like arithmetic & calculator
Calc is arbitrary precision C-like arithmetic system that is a calculator, an algorithm prototyper and mathematical research tool. Calc comes with a rich set of builtin mathematical and programmatic functions. -
8
Bandicoot
fast C++ library for GPU linear algebra & scientific computing
* Fast GPU linear algebra library (matrix maths) for the C++ language, aiming towards a good balance between speed and ease of use * Provides high-level syntax and functionality deliberately similar to Matlab * Provides an API that is aiming to be compatible with Armadillo for easy transition between CPU and GPU linear algebra code * Useful for algorithm development directly in C++, or quick conversion of research code into production environments * Distributed under the permissive Apache 2.0 license, useful for both open-source and proprietary (closed-source) software * Can be used for machine learning, pattern recognition, computer vision, signal processing, bioinformatics, statistics, finance, etc * Downloads: http://coot.sourceforge.io/download.html * Documentation: http://coot.sourceforge.io/docs.html * Bug reports: http://coot.sourceforge.io/faq.html * Git repo: https://gitlab.com/conradsnicta/bandicoot-code -
9
Math Model
Code, resources, and templates for mathematical modeling
Math_Model is a repository collecting resources, code, and algorithm templates for mathematical modeling and competition (e.g. Chinese modeling contests, US undergraduate modeling competitions). It includes LaTeX templates for writing solutions, records of past contest problems and winning solutions, algorithm implementations in MATLAB / M scripts for optimization, intelligent algorithms, numerical methods, and model frameworks. -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
10
libdspl-2.0
libdspl-2.0 is opensource cross-platform digital signal processing alg
libdspl-2.0 — opensource cross-platform digital signal processing algorithm library, written in C language. Distributed under LGPL v3 license. This allows to use this library in all applications with dynamic linking. -
11
SHA256-in-C
SHA-256 Algorithm Implementation in C
-
12
TopDeg
Program for topological degree calculation.
The program calculates the degree deg(f,B,0) where B is a product of n nontrivial intervals in R^n and f is a continuous function from B to R^n. The algorithm is described in the following paper: http://www.ams.org/journals/mcom/2015-84-293/S0025-5718-2014-02877-9/ -
13
Blueprint XAS is a Matlab-based suite designed for the processing and analysis of near-edge x-ray absorption spectroscopy (XAS) data. The suite is designed primarily to assist users in exploring reasonable fit solutions while minimizing user bias.
-
14
opbdp
opbdp (non-linear) pseudo-Boolean optimization
opbdp is an implementation in C++ of an implicit enumeration algorithm for solving (non)linear 0-1 (or pseudo-Boolean) optimization problems with integer coefficients. A research report describing the techniques used in opbdp is included. -
15
MAGeCK
Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout
MAGeCK2 is here: https://github.com/davidliwei/mageck2 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... -
16
yafu
Automated integer factorization
...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 utilize multi- or many-core processors (including SNFS, GNFS, SIQS, and ECM). YAFU is primarily a command-line driven tool. You provide the number to factor and, via screen output and log files, YAFU will provide you the factors. There is also an interactive environment similar to MATLAB or PARI/GP, where you can type commands and store results. ... -
17
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.
-
18
Rainflow
Fast rainflow counting written in C (C99)
Rainflow Counting Algorithm (4-point-method), C99 compliant. "Rainflow Counting" consists of four main steps: 1. Hysteresis Filtering 2. Peak-Valley Filtering 3. Discretization 4. Four Point Counting Method: These steps are fully documented in standards such as ASTM E1049 "Standard Practices for Cycle Counting in Fatigue Analysis" [1]. -
19
A2RMS Algorithm
Implementation of the A2RMS Algorithm in Matlab
Implementation of the A2RMS Algorithm for univariate densities defined for real values. -
20
Pigale is a graph editor and a C++ algorithm library essentially concerned with planar graphs. This software, particularly intended for graph theoretical research, includes new algorithms based on our recent theoretical researches.
-
21
SparthMP
SparthMP is an ANSI-C math library for Multi-Precision calculations
SparthMP is an ANSI-C math library for Multi-Precision calculations, i.e. beyond float/double domain. It supports regulated accuracy of calculations. For algorithm design with this library you should have an understanding of rounding errors in math. -
22
Javaluator
A java infix evaluator based on "Shunting Yard" algorithm.
Evaluate an arithmetic expression is as simple as: Double result = new DoubleEvaluator().evaluate("(e^3-1)*sin(pi/4)*ln(pi^2)"). But Javaluator provides you with much more ... Key features: - Functions support, including variable argument count. - Constants support: e, pi, etc ... - Variables support: Example sin(x) for x = pi/4. - Highly configurable: Reduce the built-in operator or function sets, define your own brackets. - Extensible: Define your own grammar, or extends the... -
23
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
24
TimescapeGlobal
a space-time interpolation geostatistical tool
...On the other hand, most of the distributions of variables used in Earth and environmental sciences show patterns of change over time, not only in space. This tool is a free, open-source software, based on a generalization of the Inverse Distance Weighted algorithm. It outputs three-dimensional, layered discrete models from which time series and equal-time GIS Grid layers can be extracted. -
25
popt4jlib
Parallel Optimization Library for Java
...Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today.