Showing 24 open source projects for "number prediction algorithm"

View related business solutions
  • Enterprise-grade ITSM, for every business Icon
    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

    Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
    Try it Free
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You 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.
    Try free now
  • 1
    PlatEMO

    PlatEMO

    Evolutionary multi-objective optimization platform

    Evolutionary multi-objective optimization platform. PlatEMO consists of a number of MATLAB functions without using any other libraries. Any machines able to run MATLAB can use PlatEMO regardless of the operating system. PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms...
    Downloads: 4 This Week
    Last Update:
    See Project
  • 2
    Flatbush

    Flatbush

    A very fast static spatial index for 2D points and rectangles in JS

    A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms.
    Downloads: 3 This Week
    Last Update:
    See Project
  • 3
    tsfresh

    tsfresh

    Automatic extraction of relevant features from time series

    tsfresh is a python package. It automatically calculates a large number of time series characteristics, the so called features. tsfresh is used to to extract characteristics from time series. Without tsfresh, you would have to calculate all characteristics by hand. With tsfresh this process is automated and all your features can be calculated automatically. Further tsfresh is compatible with pythons pandas and scikit-learn APIs, two important packages for Data Science endeavours in python...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    EASTL

    EASTL

    EASTL, Electronic Arts Standard Template Library

    EASTL stands for Electronic Arts Standard Template Library. It is a C++ template library of containers, algorithms, and iterators useful for runtime and tool development across multiple platforms. It is a fairly extensive and robust implementation of such a library and has an emphasis on high performance above all other considerations. If you are familiar with the C++ STL or have worked with other templated container/algorithm libraries, you probably don't need to read this. If you have...
    Downloads: 1 This Week
    Last Update:
    See Project
  • Crowdtesting That Delivers | Testeum Icon
    Crowdtesting That Delivers | Testeum

    Unfixed bugs delaying your launch? Test with real users globally – check it out for free, results in days.

    Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights. Click to perfect your product now.
    Click to perfect your product now.
  • 5
    Python Outlier Detection

    Python Outlier Detection

    A Python toolbox for scalable outlier detection

    ... network-based models, e.g., AutoEncoders, which are implemented in both PyTorch and Tensorflow. PyOD contains multiple models that also exist in scikit-learn. It is possible to train and predict with a large number of detection models in PyOD by leveraging SUOD framework. A benchmark is supplied for select algorithms to provide an overview of the implemented models. In total, 17 benchmark datasets are used for comparison, which can be downloaded at ODDS.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    Elite Planet Browser

    Elite Planet Browser

    Browse through the planets of the Elite game on various Z80 machines

    ... planets in the 16K RAM memory of the BBC Micro. The trick behind this is a clever algorithm based on a pseudo-random number sequence, and this algorithm is reproduced here in this program. Currently, 70 target systems are supported, including Sinclair ZX81, Jupiter Ace, ColecoVision, MSX, Tandy TRS-80, Sharp MZ, and many more. 2025-07-21: - Amstrad NC-200: keyboard input has been improved in z88dk, it is now perfectly responsive.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 7
    Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    Data Structures and Algorithms in JS

    Data Structures and Algorithms in JS

    Data Structures and Algorithms explained and implemented in JavaScript

    Are you a JavaScript developer looking to improve your craft? Then, this algorithms book is for you. This material contains the fundamental concepts to move your career to the next level. You will be able to solve problems faster in your day-to-day work and ace technical job interviews. Simply put, algorithms are several steps to solve a specific problem (e.g., sort number, search value, transform data, etc.). Algorithms are an essential toolbox for every programmer. Even if you don't realize...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    java-string-similarity

    java-string-similarity

    Implementation of various string similarity and distance algorithms

    Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity. A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. The main characteristics of each implemented algorithm are presented...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Secure remote access solution to your private network, in the cloud or on-prem. Icon
    Secure remote access solution to your private network, in the cloud or on-prem.

    Deliver secure remote access with OpenVPN.

    OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
    Get started — no credit card required.
  • 10
    HungarianAlgorithm

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    Coach

    Coach

    Enables easy experimentation with state of the art algorithms

    ... to solve. Coach collects statistics from the training process and supports advanced visualization techniques for debugging the agent being trained. Coach supports many state-of-the-art reinforcement learning algorithms, which are separated into three main classes - value optimization, policy optimization, and imitation learning. Coach supports a large number of environments which can be solved using reinforcement learning.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    MultiFast

    MultiFast

    Mass String Search and Replace Solution via Aho-Corasick Algorithm

    Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13

    qtbitreverse_demo

    recursive calculation of Bitreverse

    small QT Programm for Testing my recursive Algorithm for calculation the bitreverse of a single number in a series with Length: 2^X with X=Number of Bits
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14

    RSSA

    Rejection-based stochastic simulation algorithm (RSSA)

    Rejection-based stochastic simulation algorithm (RSSA) is an efficient exact algorithm for doing stochastic simulation of biochemical reaction systems. RSSA improves over state of the art of stochastic simulations by avoiding and collapsing as much the number of propensity updates.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15

    Prime-Number-Finder

    Prime Number Finder usign Sieve of Eratosthenes

    Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. At first you will be prompted...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    Mouse Run

    Mouse Run

    Programming Game, A Practice Tool for Building Intelligent Things

    .../(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks!
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17

    Exact Subgraph Matching Algorithm

    Exact Subgraph Matching Algorithm for Dependency Graphs

    The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    textcrypter

    textcrypter

    textcrypter is an encryption tool using vigenere cipher algorithm

    Textcrypter is an encryption tool using vigenere cipher algorithm. Vigenere use the same key/password to encrypt and decrypt a file (symmetric key cryptosystem). Result of the encryption process is a ciphertext in hexa number.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19

    Java Random Numbers - Random.Org API

    Offers Random numbers API for your programs written in Java.

    Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service. Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota. It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 20
    BayesianCortex

    BayesianCortex

    simple algorithm for a realtime interactive visual cortex for painting

    A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    We propose a novel algorithm for computing the number of ordered integer partitions with upper bounds. This problem's task is to compute the number of distributions of z balls into n urns with constrained capacities.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.