Search Results for "algorithm" - Page 7

Alpha - Beta algorithm and an item estimation in games such as Checkers, the Chess, Tic-tac-toe.

C++ genetic algorithms library (solving of the NP opnimisation problems). More GA strategies, more useability, more algorithm speed.

Simple Dijkstra shortest path implementation - for learning and teaching

FrEAK, the Free Evolutionary Algorithm Kit, is a toolkit to design and analyze evolutionary algorithms, written in Java.

Csolve is a constraint solver compiler. It compiles a set of constraints into an arc-consistency algorithm. Generated output is in the C language and can be linked with existing code. Csolve also contains libraries for standard instantiation method

Simulated annealing package written in Java using simplex downhill algorithm from Numerical Recipies in C++/FORTRAN/C It is intended for use "behind the scenes" in applications, and it is optimised for ease of integration. Completely standalone,

PPAT, or Parallel Path following Algorithm using Triangles, is a reliable parallel tool to trace the level curves of any continuous, not necessarily smooth, function f(z): C → R.

Java port and extension of MLC++ 2.0 by Kohavi et al. Currently contains ID3, C4.5, Naive (aka Simple) Bayes, and FSS and CHC (genetic algorithm) wrappers for feature selection. WEKA 3 interfaces are in development.

Robsort in a GNU public license sorting algorithm devleloped by Robert Thompson. Robsort uses random number generation to sort arrays of integers. It is claimed to be the world's least efficient sorting algorithm.

GHAPACK is a suite of tools around the Generalized Hebbian Algorithm. The Generalized Hebbian Algorithm (GHA) is a neural-net-like algorithm that allows the eigen decomposition of a dataset to be "learned" from serially-presented data.

Integer Singular Value Decomposition Genetic Algorithm Function Fitter. This is an optimization algorithm that performs a similar role to a neural network.

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...

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)

java Extremal Optimization: a package to quickly implement an extremal optimization algorithm

A java command-line application where the main goal is to solve any simplex problem. It's a team-work school project. It can be usefull for other students who needs to understand the simplex algorithm.

Tiger Solver is a sat-solver written in C. Using the DPLL algorithm and reading file in DIMACS format (cnf boolean expression). Tiger Solver use most features of many important sat-solver: - Double watches list - Chronological Backtracking ....

Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)

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.

JLyap calculates and displays image maps of the lyapunov exponents of functions. It supports smart algorithm for fast calculation of lyapunov exponent, pane selection by mouse clicking within image (no limition for aspect ratios or angles), Open/save fun

The CRISP package here developed utilizes an algorithm that describes a many-body intranuclear cascade (INC) and evaporation/fission/multifragmentation competition process.