Search Results for "number prediction algorithm" - Page 2
Sort By:
Showing 46 open source projects for "number prediction 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.
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
node2vec
Learn continuous vector embeddings for nodes in a graph using biased R
The node2vec project provides an implementation of the node2vec algorithm, a scalable feature learning method for networks. The algorithm is designed to learn continuous vector representations of nodes in a graph by simulating biased random walks and applying skip-gram models from natural language processing. These embeddings capture community structure as well as structural equivalence, enabling machine learning on graphs for tasks such as classification, clustering, and link prediction. ... -
2
Random Bits Forest
RBF: a Strong Classifier/Regressor for Big Data
We present a classification and regression algorithm called Random Bits Forest (RBF). RBF integrates neural network (for depth), boosting (for wideness) and random forest (for accuracy). It first generates and selects ~10,000 small three-layer threshold random neural networks as basis by gradient boosting scheme. These binary basis are then feed into a modified random forest algorithm to obtain predictions. In conclusion, RBF is a novel framework that performs strongly especially on data... -
3
iLib
The most comprehensive library of Javascript i18n classes available
Note: development has been moved over to github! Please see https://github.com/iLib-js/iLib "I18N" means way more than just translation. Other libraries claim to be an i18n solution when translation and string formatting is really all they offer. Yes, iLib has classes that do translation too, but there is also much, much more. From date formatting to name parsing to phone number handling to collation, iLib has classes that do it. And, it has the ability to support thousands of possible... -
4
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. -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
5
WiiGesture for Fex/AIR
Allows inclusion of Gesture Interaction via WiiMote in Web-Apps
...We used it to identify intuitive gestures from users for certain commands. The entire work was part of my diploma thesis I wrote in 2008 at Fraunhofer IGD. The gesture recognition API was included in a number of example scenarios. -
6
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 -
7
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. -
8
NextBus Public Feed Adapter for Java
A Java adapter for the NextBus Public XML Feed Service
Restful Web Service adapter for the NextBus prediction and transit network reporting service. This implementation uses XSD Schema, JAXB and a domain object model to decouple the consuming application from the over-the-wire representation of the data. NextBus is currently providing real-time bus data in several major metro transit agencies including, but not limited to MBTA (Boston), Toronto, Seattle, Brooklyn, Staten Island as well as a number of University towns. -
9
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for... -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
10
An algorithm to efficiently compute the number of products and the commonality of the features modeled by a Feature Diagram
-
11
ES-E
Evolved Studios Encryption is a new platform of protection.
ES-E is a fully downloaded encryption algorithm that you can use for your WebServer or use it for your programs (by grabbing the output off the webpage). Check the Files page for the latest build. -
12
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. -
13
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 association detection and Protein-Protein interaction identification. ... -
14
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 integers are truly random. ******************************************* Current version 1.5 is considered as STABLE version. ... -
15
tiny-AI Library
small and fast C++ library dealing with artificial intelligence
A fast artificial intelligence library which currently supports: kNN (k-Nearest Neighbor algorithm) MLP (Multilayer-Perceptron) -
16
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... -
17
ats - Automated Testing System
Object oriented Python-based tool for test automation.
...It runs these tests, either in serial or in parallel, and creates a log file (or files) describing the results of running the tests. ATS provides the capability to run serial or parallel tests simultaneously up to the resource limits it has been given (i.e. some number of processors on which to run). Tests can be given a priority rating and be dependent upon other tests, and these features are accounted for in its scheduling algorithm. The software is configurable and extensible. ATS provides numerous options for creating dependent chains of tests, filtering based on various criteria, and running tests with custom arguments. -
18
Zebra_MPTT
A PHP implementation of the modified preorder tree traversal algorithm
...Also, Zebra_MPTT uses a caching mechanism which has as result the fact that regardless of the type, or the number of retrieval operations, the database is read only once per script execution. -
19
-
20
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.
-
21
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...
