Open Source Algorithms - Page 50

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.

Tina's Random Number Generator Library (TRNG) is a state of the art C++ pseudo-random number generator library for sequential and parallel Monte Carlo simulations.

My algorithm which solves The Salesman Problem with neighborhoods written in C# with visualisation.

Genetic Algorithm based software to resolve the Traveling Salesman Problem (Problema del Commesso Viaggiatore).

Takthons provides container and manipulation services for evolved machine language routines. This allows the calling application to concentrate on the UI, the fitness evaluation and the genetic operations rather than the machine language details.

An open-source implementation of our network-based target deconvolution approach, named target addiction score (TAS). License: The TAS R-package is made available under the terms of the GNU General Public License, which means that the source code is freely available for use within other software, but if you alter the code and distribute it, you must make the new source code freely available as well. This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. In case you use the package in your work, we do appreciate a citation to the publications below. Citation: Yadav B, Peddinti G, Pemovska T, Khan SA, Szwajda A, Tang J, Wennerberg K and Aittokallio T. From drug response profiling to target addiction scoring in cancer cell models. (Submitted)

Taseree has been renamed to Drools Planner and moved to JBoss.org, see http://www.jboss.org/drools/drools-planner

Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!

DOCUMENTACIÓN A PRESENTAR. 1. Memoria preliminar describiendo la tecnología a utilizar y su justificación, planificación de las tareas a realizar y distribución de dichas tareas entre los miembros del grupo. 2. Ejecutable que cumpla los requisitos establecidos en la memoria. 3. Memoria final del proyecto, en el que se incluirá: a. Descripción de la tecnología utilizada y, en el caso de que no coincida con la establecida en la memoria preliminar, justificar el cambio. b. Descripción de los costes computacionales y requisitos tecnológicos. c. Manual de usuario del programa desarrollado. FASES 1. Entrega de la memoria preliminar (límite: 24 de febrero) (1 punto). 2. Entrega del ejecutable (4 puntos) y de la memoria final (3 puntos) (límite: 23 de mayo). 3. Presentación del trabajo (2 puntos) (28 de mayo).

A Tcl extension for genetic/evolutionary algorithm processing. It is using the GAUL library for the core functionality.

Fast cryptography extension for Tcl. TclTomCrypt is a sensible binding that brings the features and performance of LibTomCrypt to Tcl.

A test suite and benchmark for exact Euclidean distance transform algorithms used in Image Processing and computational geometry. It evaluates the exactness and speed of algorithms for a large number of test cases. Results can be visualized in Scilab.

Ky eshte nje projekt i HAPUR/FALAS per publikun Shqip-foles i cili permban nje seri Video-Kursesh, Udhezime, dhe Shembuj Kodi per gjuhe (web) si: XHTML, CSS, JS, PHP, AS3 etj. si dhe per Desktop: C++, Java, Adobe Air etj. + programe/praktika te ndryshme.

TRSL is a C++ library that implements several (statistical) sampling schemes behind an (STL-like) iterator interface. The library may be used e.g. in particle filtering. It is distributed under the Boost SL (BSL is a free-software license).

A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com

Terra Artifex is a demo project presenting a novel approach to interactive terrain rendering for potentially infinite landscapes that can be modified in runtime.

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

AleSimpleLexer is a C# class that tokenizes given text. Can process lists, numbers, text constants, parentheses and comments. Supports unicode.

TextDiff.NET is the .NET component to list differences between two integer arrays using a "longest common subsequence" algorithm. Typically, this component is used to diff 2 text files once their individuals lines have been hashed.

Python library for comparing the distance between two or more sequences by many algorithms. For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). TextDistance show benchmarks results table for your system and saves libraries priorities into the libraries.json file in TextDistance's folder. This file will be used by text distance for calling the fastest algorithm implementation. Default libraries.json is already included in the package.

Implementations of various algorithms using CUDA.

Three software packages to work with RFC2617 digests: libdigest (C library to compute digests), libcppdigest (C++ library to manage /etc/passwd-like files) and libpam-digestfile (PAM module allowing authentication via an /etc/passwd-like file)

Machine learning models for edge devices need to have a small footprint in terms of storage, prediction latency, and energy. One instance of where such models are desirable is resource-scarce devices and sensors in the Internet of Things (IoT) setting. Making real-time predictions locally on IoT devices without connecting to the cloud requires models that fit in a few kilobytes.These algorithms can train models for classical supervised learning problems with memory requirements that are orders of magnitude lower than other modern ML algorithms. The trained models can be loaded onto edge devices such as IoT devices/sensors, and used to make fast and accurate predictions completely offline. A tool that adapts models trained by above algorithms to be inferred by fixed point arithmetic.

The FreeBASIC Standard C++ Library Port (fbstd) brings the containers, iterators, algorithms and streams available in C++ to FreeBASIC programmers.