Search Results for "algorithm finder"
Sort By:
Showing 16 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.
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
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. -
2
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. -
3
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... -
4
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... -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
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/ -
6
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:...
-
7
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 -
8
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. -
9
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.
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
10
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. -
11
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.
-
12
-
13
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.
-
14
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
-
15
The Tandem Repeat Occurrence Locator -- TROLL -- is a light weight SSR finder based on a slight modification of the Aho-Corasick algorithm.
-
16
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
