Open Source Algorithms - Page 48

Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion

Небольшая и быстрая библиотека написанная на javascript, которая генерирует псевдослучайные числа с практически непредсказуемым разбросом вероятности выпадения для каждого генерируемого числа, а также случайно динамическими границами диапазона псевдослучайной последовательности (для каждого генерируемого числа). Другими словами: эта библиотека ведет себя настолько не предсказуемо, что иногда выдает неопределенное значение (NaN) или бесконечность (Infinity), и почему это происходит не знает даже сам разработчик!

This simplesudodu program is intend for studying in the sudoku solution algorithm rather than a game (If you want to make it a game, it's OK ^_^). Later I will implement the 4*4 or other kinds. Different sudoku requires different algorithm to solve.

A high-performance C++ Sudoku solver implementing Knuth's Dancing Links (DLX) algorithm — one of the fastest exact cover algorithms in the world.

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.

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

The supervised-reptile repository contains code associated with the paper “On First-Order Meta-Learning Algorithms”, which introduces Reptile, a meta-learning algorithm for learning model parameter initializations that adapt quickly to new tasks. The implementation here is aimed at supervised few-shot learning settings (e.g. Omniglot, Mini-ImageNet), not reinforcement learning, and includes scripts to run training and evaluation for few-shot classification. The fundamental idea is: sample a task, train on that task (inner loop), and then move the initialization parameters toward the adapted parameters (outer loop). Because Reptile is a first-order algorithm, it avoids computing second derivatives or full meta-gradients, making it computationally simpler while retaining good performance. The repo includes training scripts, dataset fetchers (Omniglot, Mini-ImageNet), and modules for defining the Reptile update logic, variables, and hyperparameters.

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml

A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.

SweenJet helps developers to create Java applications. It provides constrained models, useful Swing components (e.g. splash screen, input fields), actions, look-and-feel enhancements (e.g. themes, multi-line tooltip), and a complete preferences system. This project is no longer actively developed.

Swift Algorithm Club is a project that implements a broad collection of algorithms and data structures in the Swift programming language, with clear commentary and educational intent. Its purpose is not primarily to be a utility library, but rather to teach the how and why behind algorithms—readers can study implementations, complexity, and design choices in a Swift context. The repository includes common classic algorithms (sorting, searching, trees, graphs, dynamic programming, etc.) and structures (queues, heaps, tries, balanced trees) along with writeups explaining them. Because it's in Swift, the code is idiomatic and leverages Swift language features and standard patterns, which helps learners see how algorithmic ideas map into modern code. Many of the algorithms come with test harnesses so you can run them and experiment.

Swiss Army Knife C++ Toolkit is a set of versatile tools for C++ development. It offers to a developer variety of everyday needed tools for programming. Among these tools are configuration files reader, Tokeniser, Singleton template and many more.

Syntactic is a simple C++ library for constructing general Neural networks. For now the library supports creation of multi layered networks for the Feedforward Backpropagation algorithm as well as Time Series Networks. More will be implemented soon.

Centre is a synthetic trajectory generator environment that aim to generate semantic-based trajectory datasets usable for spatio-temporal data-mining algorithms in testing and validation process.

This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.

Stochastic discrete event system analysis and verification are essential in order to ensure reliability in such systems. However, models that cannot be constructed with an hand-made process need to be learned. Thus, the SDES toolbox proposes an automated solution that is embedded in Matlab to learning and analisis generalized semi-Markov processes.

This project is intended to provide Git access to the code of the original project, TA-Lib, which uses Subversion. It is intended for system integrators wishing to use TA-Lib in their Git-managed project through Git submodules or subtrees. No actual development is being done here; all development happens in the original project.

TBOX is a glib-like cross-platform C library that is simple to use yet powerful in nature. The project focuses on making C development easier and provides many modules (.e.g stream, coroutine, regex, container, algorithm ...), so that any developer can quickly pick it up and enjoy the productivity boost when developing in C language. It supports the following platforms: Windows, Macosx, Linux, Android, iOS, BSD and etc. Supports file, data, http and socket source. Supports the stream filter for gzip, charset. etc. Implements stream transfer. Implements the static buffer stream for parsing data. Supports coroutine and implements asynchronous operation. The coroutine library. Provides high-performance coroutine switch. Supports arm, arm64, x86, x86_64. Provides channel interfaces. Provides semaphore and lock interfaces. Supports io socket and stream operation in coroutine. Provides some io servers (http ..) using coroutine. Provides stackfull and stackless coroutines.

TCache is high performance key/value storage component. It can be easily plugged into any existing high-performance, distributed memory object caching systems such as MemcacheD or Dynamo, speeding up dynamic web applications by reducing database load

Teeser is a java-based integration framework for engineering emergent self-organizing behavior in distributed systems. It contains tools for analysis, tuning, macroscopic probing and simulations of distributed systems. Library of tools can be extended and everybody is encouraged to provide and share its tools with the community. The main idea is to provide application designers ability to seamlessly use tools which are helpful to design self-organizing behavior. Designers can continue to use their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information.

This is the code used in the following paper: Andy Diwen Zhu, Wenqing Lin, Sibo Wang, and Xiaokui Xiao. Reachability queries on large dynamic graphs: a total order approach. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data (SIGMOD '14). Please cite the paper if you choose to use the code.

Serve timeouts by calling a service-function periodically and an independent time-source (toticker). If you need a timer and like to try this one, please write your experiences to me in brief! And may be suggestions, of course. 10ms tick time should be possible. May be less. DO NOT USE Version less 0.1.1 - it is definatly buggy! Easy to control timers via Handle, eg auto create&start a timer via totimer_setTimeout function. Optionally use Callback-Functions if timeout expires. See uws-readme.txt for further info.

It is the source code for a tree mining algorithm called TRIPS. It can mine frequent subtrees from a forest of tree structures.