Search Results for "algorithm finder"
Sort By:
Showing 22 open source projects for "algorithm finder"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
1
crypto wallet finder
Wallet Finder, Recover lost crypto across major blockchains.
"Wallet Finder – Cryptocurrency Wallet Maker & Balance Locator for Lost Bitcoin (BTC), Ethereum (ETH), BNB, Polygon (MATIC), EVM-Compatible Chains & Bitcoin Wallet Recovery" Unlike Python-based brute-force tools, Wallet Finder is built in C++ and tuned for multi-threaded CPU and GPU workloads, delivering up to 10× faster throughput. Because true randomness doesn’t exist in computing—only pseudo-randomness—deterministic wallet generation can exhibit patterns and possible vulnerabilities.... -
2
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. -
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
Approximate Solution Finder
An open-source approximate logic design tool
We provide an open-source library of approximate multipliers described using Verilog HDL. The article related to the library is currently under review. -
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.
-
5
wisp
Wisp - A preference based location finder app
The work of finding the best place according to user preference is tedious task. It needs manual research and lot of intuitive processes to find the best location according to some earlier knowledge about the place. It is mainly about accessing publicly available spatial data, applying a simple algorithm to summarise the data according to given preferences, and visualising the result on a map. We introduced JJCluster to eliminate the rigorous way of researching about a place and visualizing... -
6
Path Finder Qt
finds the sortest path on the square board. GUI is implemented in Qt.
The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics... -
7
Shortest Path Graph A star
finds the sortest path on the directed graph using A* algorithm.
It is the implementation of the A* algorithm for directed graph. Additionally, the implementation of the Graph is provided. For visualization of the graph and the results of the A* algorithm the data are exported in GraphViz (Graph Visualization Software) format: http://www.graphviz.org/ Various exemplary solutions are provided. See also my other two projects related to A* algorithm: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/a-star/ -
8
This package includes a collection of MATLAB files which are designed to: 1. Given a calibration scan of the image of a point emitter with an engineered point spread function (PSF), 2. Perform a phase retrieval algorithm based on maximum likelihood estimation (MLE) of a phase aberration term which is added to the theoretical pupil function of the imaging system. 3. Use the phase-retrieved pupil function to perform single-emitter localization. Accompanying publication available here:...
-
9
A star
it is an implementation of A* algorithm with examples of its usage.
A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm -
Paessler - Monitor Your Whole Network in MinutesWaiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
-
10
Intelligent Keyword Miner
Intelligent SEO keyword miner and predicing tool
...This program is intelligent as it predicts what you may want to search next, based on your personal trends. After searching the suggestions, you can choose to reset or train it further. Programs that have similar idea are: Google AdWords, SERPWoo's Keyword Finder, Wordpot, and others. Difference is, this program is intelligent and it accepts your input data and then predicts keywords based on your likes or dislikes. As the main engine, it uses the SMOReg algorithm to analyze and map the keyword frequencies of your data. This can be a great SEO tool to help increase the traffic of any website featuring a product. -
11
SpeakerFinder
Speaker Identification
Speaker Finder is speaker identification tool powered by 3 different technique in the background . 1 - GMM with GFCC (gammatone filter ceptral coefficient) 2 - GMM with Pitch(f0) 3 - NGrams with f0 SpeakerFinder should be trained with speaker's sound first than, program can be used the recognized trained speakers. Project also has a validation phase which choose which algorithm above 3 will give best result for spesific speaker. -
12
Duplicate Files Finder is a cross-platform application for finding and removing duplicate files by deleting, creating hardlinks or creating symbolic links. A special algorithm minimizes the amount of data read from disk, so the program is very fast.
-
13
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. ... -
14
qlsdup
GUI based lightweight duplicate file finder / remover.
Simple GUI based lightweight duplicate file finder and remover. Configurable file search and preview (via external tools) option for file data. No command-line interface available! This is basically a reimplementation of dupfinder as: it doesn't compile on my computer, the executable won't work either, the projects seems dead and I didn't wanna work through the original code. -
15
D-finder is a bioinformatic search algorithm for the identification of D-sites in JNK interacting proteins. The algorithm is a combination of pattern matching and a hidden markov model (HMM) based on a training set of known JNK D-sites.
-
16
-
17
-
18
This program is based on a algorithm that solves a Master Mind combination. The algo seems to work but without hole and with 5 different colors in an atempt.
-
19
GD is AI - ALife becoming true. It's a genetic engine server, capable to run any kind of genetic algorithm. It has TCP architetcure, working with software clients and uman interaction. It has plugin capabilities and comes with a working Function Finder
-
20
The Tandem Repeat Occurrence Locator -- TROLL -- is a light weight SSR finder based on a slight modification of the Aho-Corasick algorithm.
-
21
Hill Finder
Detection of Proximal RNA Binding Sites in HITS Data
High-throughput sequencing has been widely used to find novel protein-binding RNAs, utilizing methods such as CLIP-Seq and Genomic SELEX. Typical analyses of the high-throughput data employ the use of a histogram of the aligned read count per base, the intensity of which indicates, for a specific region of an RNA, the underlying sequence's relative occurrence of binding events in the experiment. This technique can, however, obscure the precise locations of binding sites in close proximity to... -
22
It's an implementation of the A* algorithm together with a grid processor which pre-processes 8-bit bpm graphic files using a variable resolution and an SDL user interface to test it.
- Previous
- You're on page 1
- Next
