Search Results for "algorithm"
Sort By:
80 programs for "algorithm" with 2 filters applied:
-
Your top-rated shield against malware and online scams | Avast Free AntivirusOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
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.
-
1
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. It comprises powerful input interpretation options. Compliant with Ross Williams... -
2
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. -
3
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... -
4
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. -
Simplify IT and security with a single endpoint management platformNinjaOne automates the hardest parts of IT, delivering visibility, security, and control over all endpoints for more than 20,000 customers. The NinjaOne automated endpoint management platform is proven to increase productivity, reduce security risk, and lower costs for IT teams and managed service providers. The company seamlessly integrates with a wide range of IT and security technologies. NinjaOne is obsessed with customer success and provides free and unlimited onboarding, training, and support.
-
5
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... -
6
A2RMS Algorithm
Implementation of the A2RMS Algorithm in Matlab
Implementation of the A2RMS Algorithm for univariate densities defined for real values. -
7
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.
-
8
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.
-
9
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.
-
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.
-
10
TimescapeGlobal
a space-time interpolation geostatistical tool
This software is a time-aware geostatistical tool. Including time variability adds further issues to the already complicated field of geostatistical interpolation. 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... -
11
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. 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... -
12
An implementation of the Joint Generation Algorithm of Fredman and Khachiyan for the computation of a dual pair of monotone boolean formulas in DNF (hypergraph transversals, extreme rays of polyhedral cones...). User-replaceable oracle.
-
13
n-chinese-remainders
chinese remainder theorem - progressive solving, n-soln, extras
"chinese remainder" solves a system of equations over modulus quickly. crtwo is an improvement to Mathematica's release. crtwo: solves Chinese Remainder a pair at a time, (uses gcd), yet is still fast. Which means crtwo, unlike text book soln, uses an algorithm to solve or fail one mod equation at a time. showing win or fail of each eqn and solving other sawtooth intersections is possible, due to that. crAll2@crtwo provides n soln near x for CR using width of soln crchart3... -
14
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... -
15
Flamethyst is a flame fractal renderer written in java. It generalizes the classical algorithm in several ways, and support most features of Apophysis .flame files.
-
16
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 sorting... -
17
PortOpt
A portfolio-optimizer using Markowitz(1952) mean-variance model
... portfolio. In order to minimise the variance it internally uses QuadProg++, a library that implement the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method. This solution is very efficient as it allows to solve hundred of thousand of portfolio problems in seconds. PortOpt runs as a text/console tool so it can be easily used in your own scripts. -
18
GGNFS is an open source implementation of General Number Field Sieve algorithm for factoring integers.
-
19
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79... -
20
ExactCalc
Software for exact computing based on interval arithmetic.
... interval that contains exact result of computation. Sometimes is more easy to use numerical unstable algorithm to solve problem. Instability is actually speed of accumulating the truncation error, but it can be decreased arbitrary by using more precise computation. Interval arithmetic provides us control of accumulating truncating error. To save Your time using CPU time this program provides interpreter of simple programming language based on interval algebra with arbitrary precision arithmetic. -
21
libdwt
a cross-platform discrete wavelet transform library implemented in C
libdwt is a cross-platform discrete wavelet transform library implemented in C language. The library implements fast wavelet transform algorithm using lifting scheme. Cohen-Daubechies-Feauveau wavelets with 4 vanishing moments were used. -
22
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance... -
23
KL1p
A portable C++ library for Compressed Sensing
KL1p is a portable C++ framework for handling sparse recovery of inverse problems of underdetermined linear systems, like in compressed sensing technique. -
24
PyGAO
Genetic Algorithm Optimization for Python
A simple interface for performing genetic algorithm optimization for numerical problems. I am starting with a stripped-down version, where a solution can be described using a single vector of float numbers. Eventually, I will expand to more generic data structures and add multiple-species search options. For the time being, I have no plans of developing a GUI. For now, this is strictly a computational module. In addition to the standard Python libraries, PyGAO uses numpy. -
25
FreDec
Parallelized FREquency DEComposer algorithm
This is a parallelized algorithm performing a decomposition of the time-series data into a number of sinusoidal components, disentangling them from the white Gaussian noise. The algorithm analyses all suspicious frequencies, including the ones that look like an alias at a glance, but may become preferable later. After selection of the initial frequency candidates, the algorithm passes through all their possible combinations and estimates their multi-frequency statistical significance...
