program to evolve biomorphs using genetic algorithms

bugsx is a program which draws biomorphs based on parametric plots of Fourier sine and cosine series and let's you play with them using genetic algorithms.

Family of Multilevel Partitioning Algorithms

METIS: A Family of Multilevel Partitioning Algorithms . This is a collection of serial and parallel programs & libraries that can be used to partitioning unstructured graphs, finite element meshes, and hypergraphs, both on serial as well as on parallel computers. . Adaptation of METIS for Code_Aster purpose

library for graph automorphisms -- interface and tools

nauty (No AUTomorphisms, Yes?) is a set of procedures for computing automorphism groups of graphs and digraphs. This mathematical software suite is developed by Brendan McKay and Adolfo Piperno: http://pallini.di.uniroma1.it . nauty computes graph information in the form of a set of generators, the size of the group, and the orbits of the group; it can also produce a canonical label. The nauty suite is written in C and comes with a command-line interface, a collection of command-line tools, and an Application Programming Interface (API). . This package provides the nauty interface named dreadnaut, and a small collection of utilities called gtools.

/non-free/parmetis/parmetis-test

Parallel Graph Partitioning and Sparse Matrix Ordering Tests

ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and orders variables for minimal fill when using direct solvers for sparse matrices. It does all this in parallel, and also can efficiently re-partition a graph or mesh whose connectivity has changed. . This package contains programs which test the ParMetis libraries using files in the parmetis-doc package's examples directory.

large subroutine library for plotting scientific data

This package contains both runtime and development libraries. Many routines are included in pgplot for viewing scientific data. Many (about 70) output devices are supported. 2-D, 3-D, contour, image manipulation, etc. are well supported. Interactive routines are included. Both a C and a FORTRAN library are present. See http://astro.caltech.edu/~tjp/pgplot/ for documentation.

The Stanford GraphBase: combinatorial data and algorithms

A highly portable collection of programs and data for researchers who study combinatorial algorithms and data structures. . The programs are intended to be interesting in themselves as examples of literate programming. Thus, the Stanford GraphBase can also be regarded as a collection of approximately 30 essays for programmers to enjoy reading, whether or not they are doing algorithmic research. The programs are written in CWEB, a combination of TeX and C that is easy to use by anyone who knows those languages and easy to read by anyone familiar with the rudiments of C. . This package contains only the libraries and the demonstration programs; for the readable source code, which forms the documentation as well, see the sgb-doc package.

/non-free/testu01/testu01-data

testing suite for uniform random number generators -- data

TestU01 is a software library, implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators. . TestU01 implements several types of random number generators in generic form, as well as many specific generators proposed in the literature or found in widely-used software. It provides general implementations of the classical statistical tests for random number generators, as well as several others proposed in the literature, and some original ones. These tests can be applied to the generators predefined in the library and to user-defined generators. Specific tests suites for either sequences of uniform random numbers in [0,1] or bit sequences are also provided, as well as basic tools for plotting vectors of points produced by generators and more advanced tools for more involved tests and usage. . This package provides the essential TestU01 architecture independent material, namely shared data.

/non-free/testu01/testu01-bin

testing suite for uniform random number generators -- utils

TestU01 is a software library, implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators. . TestU01 implements several types of random number generators in generic form, as well as many specific generators proposed in the literature or found in widely-used software. It provides general implementations of the classical statistical tests for random number generators, as well as several others proposed in the literature, and some original ones. These tests can be applied to the generators predefined in the library and to user-defined generators. Specific tests suites for either sequences of uniform random numbers in [0,1] or bit sequences are also provided, as well as basic tools for plotting vectors of points produced by generators and more advanced tools for more involved tests and usage. . This package provides command line utilities.