Search Results for "algorithms" - Page 64

CSPSimple is a simple solver for Constraint Satisfaction Problems.

Yasa is yet another simulated annealing. Using this metaheuristic we determine near optimal schedules for a given task graph. As this is computationally intensive, we use the pvm library to allow parallel computations on workstation clusters.

The goal of an Open Math Library is to provide the basic set of math-related classes and functions for 3d engine development. Currently the library has implementations for vectors (2 to 4 dimensional), matrices, planes and quaternions.

Weka++ is a collection of machine learning and data mining algorithm implementations ported from Weka (http://www.cs.waikato.ac.nz/ml/weka/) from Java to C++, with enhancements for usability as embedded components.

Portable, optimised implementation of Bruce Schneier's 64-bit symmetric block cipher, Blowfish. Includes support for ECB, CBC, CFB, OFB and CTR block cipher modes, weak key detection and parallelisation using OpenMP.

The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).

Connection pool: manage SQL in file, Strong (auto recover/detect connection) Data persistence: Store/fetch java object from/to DB/XML/PureText. configable XML: extend W3C DOM Programming: extend java, (multi-line properties etc.)

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.

Multicast Inter-Domain Routing for MANETs (or MIDRM) is a multicast support system for IDRM, a novel networking framework, which enables inter-domain routing between Mobile Ad Hoc Networks (MANETs) and between MANETs and the Internet.

Application to automatically merge gedcom files. It provides either a user or another program the ability to merge gedcom files with as little human interaction as possible and with high quality of matching results.

The documentation of first release of zmicer.utils is available here http://jpatterns.sourceforge.net/zmicerutils/project-summary.html. JZmicer.utils provides the set of the utility classes for the increasing the productivity of Java developers.

This is a library for an extensible framework for range encoding. The framework is an extensible object-based state machine where probabilities are chosen based on the current frame the machine is in.

GDTTLA aims to be a comprehensive yet easy to use, stable IDE for the TLA+ tools.

Bebops ("Belief Base Operations") provides semi-revision, contraction and kernel operators for an OWL-backed Belief Base.

SCOPE stands for Symbolic COmputation Parallel Environment. We aim at providing an environment for symbolic computation, that is easily expandable, easy to use, parallel, effective and free.

Provides functional programming abstractions for C# including map, fold, filter functions for .NET collections, the option data type, a lazy type, a functional list type, lazy functional lists, and more. Superseded by http://sf.net/projects/sasa/

Validator e uma API para auxiliar na validação de dados.

A Web based IDE that supports nodes and edges (graphs) with attributes. An interpretor executes your graphs. Views of graphs allow developers to see references to variables, easily see the path of execution and rearrange the structure of data and program

The Watermarks is a java library for images and text watermarking fingerprinting and tamper-proofing. The supported carrier formats for a watermark are JPEG and PDF. The project also aim to build a test environment to evaluate robustness of implemented a

We propose a novel algorithm for computing the number of ordered integer partitions with upper bounds. This problem's task is to compute the number of distributions of z balls into n urns with constrained capacities.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and...

Isometric engine for 2D rendering. Supported frameworks: * SDL * XNA * easily extendable to other frameworks Features: * diamond maps of different width and height * user defined tile size (via rendering metrics) * supports 1 static tile + and any amount of movable elements per cell * z-order display * supports animated tiles * supports zooming (ability to define tilesets for different rendering metrics and switch between them) * supports multi-cell elements

librpa is Random Precision Arithmetics free C++ crossplatform library which provides different arbitrary precision arithmetic operations. It is aimed to be simple to use, fast to perform and light.

Jmathtools: math java stuff designed to be easily used, modified and extended. Initially designed to help porting of matlab software to java. 2D/3D plot, linear algebra, basic statistics. Groovy wrapper providing syntax close to Matlab/Scilab.

Large amounts of clinical information are locked up in free text of clinical adverse event reports. AEFI Tools is a toolkit to extract information from free text using NLP, machine learning and the Unified Medical Language System.