Search Results for "number prediction algorithm"
Sort By:
Showing 19 open source projects for "number prediction algorithm"
View related business solutions-
Papirfly: Best user-friendly DAM and Content Creation SoftwarePapirfly provides a single online destination for all your employees and other stakeholders who are engaging with your brand, ensuring consistency in all aspects of their communications. Teams can produce infinite studio-standard marketing materials from bespoke templates, store, share and adapt them for their own markets and stay firmly educated on the brand’s purpose, guidelines and evolution – with no specialist skills or agency help necessary.
-
QA Wolf | We Write, Run and Maintain TestsQA Wolf is an AI-native service that delivers 80% automated E2E test coverage for web & mobile apps in weeks not years.
-
1
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. -
2
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. ATC Online Alpha: https://advantrigoncalc.sourceforge.io/atc/ More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by... -
3
...This ~2500 lines Pure C factorization software : - is imediately compatible with Microsoft Windows, Linux (no one dependancy) - is a C99 command line factorizer from 0 to 300 bits (330 bits were factored in the lab) - is built so that you can easily use and test the software - use its own "big num" library named cint - use AVL trees to organize information - use Lanczos Block, a pure C iterative matrix eigenvalues finder algorithm - use Pollard's Rho algorithm to answer under 64 bits The Microsoft Windows executable is included in the zip, the readme.md gives you details. Small and larger RSA numbers have been factored by the software, such as the 100 decimal digit number RSA-100. The software factored the 321-bit RSA number relating to the "bank card case".
-
4
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. ... -
Paladin Point of Sale is a powerful retail management system designed to simplify daily store operations for independent retailers.Paladin Point of Sale is ideal for independent retailers in hardware, lumber, pharmacy, and specialty retail industries seeking an easy-to-use, industry-specific POS system with strong support and flexibility.
-
5
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 network flow and other graph algorithms. ... -
6
GPMfit
Gaussian Process Model Fitting
Gaussian Process model for fitting deterministic simulator output. Establish efficient and reliable likelihood optimization through hybridized DIRECT-BFGS and multi-start BFGS algorithms. Programming Language: Matlab. -
7
n-chinese-remainders
chinese remainder theorem - progressive solving, n-soln, extras
...other funs: Euclidians, showFactors, changeBaseArr, caesar, rsa, inverseMod, IntToModTups (large number math for PC's) crfindnSolnAfterxInEqm (solve saw wave LL,RL,LR,... intersects) congruence, plots, y-shifted triangular wave solve, testing (for historic reasons files are also in https://sourceforge.net/projects/periodictablemm/) -
8
WorldCupRatings
Soccer tournament predictions & simulations
...Bundesliga) simulation - based on Elo coefficient method, it calculates probabilities for Championship, Final, Quarter-Final, etc - additional features: single-play prediction, Elo number calculator, odd quota estimation Impress your friends with soccer expertise - just download, install & run! -
9
GGNFS is an open source implementation of General Number Field Sieve algorithm for factoring integers.
-
Workspace management made easy, fast and affordable.The way we work has changed and Clearooms puts you in complete control of your hybrid workspace. Both meeting rooms and hot desk booking can be easily managed to ensure flexible and safe working, however big or small your organisation.
-
10
GDLOG
Implementation of the GNFS for discrete logarithm problem in GF(p)
GDLOG is an implementation of the General Number Field Sieve algorithm for discrete logarithm problem in GF(p). -
11
Face Recognition System
Face Recognition System Matlab source code
Research on automatic face recognition in images has rapidly developed into several inter-related lines, and this research has both lead to and been driven by a disparate and expanding set of commercial applications. The large number of research activities is evident in the growing number of scientific communications published on subjects related to face processing and recognition. Index Terms: face, recognition, eigenfaces, eigenvalues, eigenvectors, Karhunen-Loeve algorithm. -
12
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. ... -
13
PyPedal is a Python module that provides tools for the manipulation of pedigrees, simple visualization of pedigrees, and the calculation of measures of genetic diversity from pedigrees.
-
14
This library provides a general purpose polynomial calculator for actionscript 3. This includes basic math operators, deriviatives, finding zeros (uses TOMS493 algorithm), and solving. Supports copmlex coeffiecents and rational polynomials.
-
15
Simple UI to test the effectiveness of a heuristic algorithm against the brute force method for path finding among an arbitrary number of arbitrarily placed points on a grid. This is an educational project, don't expect new and better methods.
-
16
This is a collection of vb class modules written in native Visual Basic. They provide the following functionality: Processing of very large integer numbers, hashing algorithms, prime number handling and an implementation of the RSA algorithm.
-
17
NAC is a collection of tools for cryptography. The goal is to provide simple-to-use crypto tools (like an OTP, String and number generator, public key algorithm...) you can use under Linux, Windows...
-
18
Robsort in a GNU public license sorting algorithm devleloped by Robert Thompson. Robsort uses random number generation to sort arrays of integers. It is claimed to be the world's least efficient sorting algorithm.
-
19
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
- Previous
- You're on page 1
- Next
