Search Results for "algorithm"
Sort By:
Showing 509 open source projects for "algorithm"
View related business solutions-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
Build Securely on AWS 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.
-
1
Yao
Extensible, Efficient Quantum Algorithm Design for Humans
...Its CUDA backend and batched quantum register support can make typical quantum circuits even faster. Yao is designed to be extensible. Its hierarchical architecture allows you to extend the framework to support and share your new algorithm and hardware. -
2
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
3
BQSKit
Berkeley Quantum Synthesis Toolkit
The Berkeley Quantum Synthesis Toolkit (BQSKit) [bis • kit] is a powerful and portable quantum compiler framework. It can be used with ease to compile quantum programs to efficient physical circuits for any QPU. A standard workflow utilizing BQSKit consists of loading a program into the framework, modeling the target QPU, compiling the program, and exporting the resulting circuit. -
4
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... -
$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
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. -
6
GenX
X-Ray and Neutron Reflectivity Modeling
GenX is a scientific program to refine x-ray refelcetivity, neutron reflectivity and surface x-ray diffraction data using the differential evolution algorithm. GenX is very modular and highly extensible and can be used as a general fitting program. -
7
GNSS-SDR
An open source software-defined GNSS receiver
An open source software-defined Global Navigation Satellite Systems (GNSS) receiver written in C++ and based on the GNU Radio framework. -
8
cfMesh
A library for polyhedral mesh generation
...It is already a part of foam-extend, OpenFOAM for Windows, Caelus and OpenFOAM+ released by ESI. This repository is intended for contribution and collaborative development. If you have a new meshing algorithm or interested in contributing to cfMesh, do not hesitate to contact us. Please note that this code is not the same as CF-MESH+, which is a commercial product offered by Creative Fields Holding. -
9
GRAMPC
A gradient-based augmented Lagrangian framework for embedded NMPC
GRAMPC is a nonlinear MPC framework that is suitable for dynamical systems with sampling times in the (sub)millisecond range and that allows for an efficient implementation on embedded hardware. The algorithm is based on an augmented Lagrangian formulation with a tailored gradient method for the inner minimization problem. GRAMPC is implemented in plain C with an additional interface to C++ and MATLAB/Simulink. The basic structure and usage of GRAMPC are described in the documentation that comes along with the source files. More details about the algorithm and its performance can be found in the corresponding article published in Optimization and Engeneering. ... -
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.
-
10
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. -
11
Bifurcum
Software to run through a directional graph.
This software runs through a directional graph and writes the paths it found as test specifications. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This application sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. Technically it is a front end for the library Bifurcumlib. -
12
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. -
13
headsort
headsort: streaming sort + 2x faster than gnu sort
...In general headsort can sort in 1/2 the time sort(1) (mergesort) does in situations involving either pipes or mult column selection; less than 1/2 with both. Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done. This means it has new applications in distributed computing and in some cases makes dc un-necessary. (gnu sort must finish all bins) Well compatible with gnu sort (not perfect). ... -
14
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
-
15
PetoronHash-System
PHASH | post-quantum XOF hashing algorithm | C++20
PHASH is a self-contained, dependency-free, post-quantum XOF hashing algorithm implemented in modern C++20. This release delivers the first fully stable production implementation of the PetoronHash-System — a 1600-bit sponge-based hash function with domain separation, extendable output, and deterministic behavior. Key Features No external dependencies — pure C++20 implementation. Extendable Output (XOF) — supports arbitrary output length (256–8192+ bits). -
16
JQM Java Quine McCluskey
JQM - Java Quine McCluskey for minimization of Boolean functions.
Java Quine McCluskey (JQM) implements the Quine-McCluskey algorithm with Petrick’s Method for minimizing Boolean functions. Designed for both education and industrial application, it handles up to 16 variables and functions. Uniquely, JQM bridges the gap between theory and practice: it visualizes the solution process with generated Karnaugh Maps for students, while supporting PLC engineers by exporting results to Structured Text (ST) and Ladder Diagram (LD). -
17
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. -
18
Iterate is an implementation of the Bravais-lattice-finding algorithm from: Andrews and Bernstein, Acta Cryst. (1988). A44, 1009-1018 Lattices and Reduced Cells as Points in 6-Space and Selection of Bravais Lattice Type by Projections.
-
19
itom
itom - an Open Source Measurement, Automation and Evaluation Software
itom is an open source software suite for operating measurement systems, laboratory automation and data evaluation. One main application of itom is the development and operation of sensor and measurement system for instance in a laboratory environment. Therefore, the software has to be able to communicate with a wide range of different hardware systems, such as cameras or actuators and should provide a diversified and as complete as possible set of evaluation and data processing methods.... -
20
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 -
21
iElectrodes
intracranial electrodes localization toolbox
...Precise and reliable localization can be achieved fast and in a semiautomatic way with minimal user intervention. The toolbox works with ECoG (subdural grids and strips) and SEEG (depth) electrodes. The new GridFit algorithm can precisely localize high-density electrodes (up to 3mm). Brain parcellations (atlas) and surfaces can be imported to aid 2D and 3D visualization and anatomical localization can be done in native or normalized space. You can plan grid and depth electrode array implantations and compare them with the implanted locations. Additional scripts are provided for image coregistration using SPM, Freesurfer pipeline integration, etc. ... -
22
LabRPS
Random phenomena generator
This is an official mirror of LabRPS. Code and release files are primarily hosted on https://github.com/LabRPS/LabRPS and mirrored here LabRPS aims to be a tool for the numerical simulation of random phenomena such as stochastic wind velocity, seismic ground motion, sea surface ... etc. It can be in a wide range of uses around engineering, such as random vibration or vibration fatigue in mechanical engineering, buffeting analysis in bridge engineering.... LabRPS is mainly to assist... -
23
gendasm
Generic Code-Seeking Diassembler with Fuzzy-Function Analyzer
...It will disassemble the code and follow through branches to assist in the separation of code and data. Its included Fuzzy Function Analyzer companion uses a DNA Sequence Alignment Algorithm to locate similar code in multiple binaries to facilitate reverse-engineering and/or code recovery. The original purpose of the Fuzzy Function Analyzer was to assist in code recovery where the source code for the current binaries got lost, yet the source code for an old binary was retained. The Fuzzy Function Analyzer allows you to match up known functions between the two binaries so you can concentrate on disassembling and reverse engineering the parts that are different and recover the code for the current binary that got lost. -
24
Fosite - advection problem solver
numerical simulation code for solving transport equations in 1D/2D/3D
Fosite is a generic framework for the numerical solution of hyperbolic conservation laws in generalized orthogonal coordinates. Its main purpose is the simulation of compressible flows in accretion disks. The underlying numerical solution method belongs to the family of unsplit conservative finite volume TVD schemes. The method is 2nd order accurate in space and uses high order Runge-Kutta and multistep schemes for time evolution. In addition to the pure advection code several source terms... -
25
...Book uses the examples from the demo project to explain everything in details. The examples are from many different areas. Examples from the first part of the book are aimed at the details of algorithm and its use with different objects; examples from the second part are mostly the real and very useful applications.