j-redundancy-2012_experiments package
==============================

This is an experimental package for the article:

REDUNDANCY ELIMINATION IN HIGHLY PARALLEL SOLUTIONS OF MOTION COORDINATION PROBLEMS

by Pavel Surynek

submitted to the IJAIT journal.


The purpose of this package is to allow full reproducibility of results presented in the paper. The complete
source code as well as experimental data in the raw form are provided. The reader of the paper can easily check
the results by himself. The package is intended to be archived on this web for as long as possible.

Experimental data was obtained on Pentium 4, 2.4GHz, 512MB RAM, under Mandriva Linux 10.1, 32-bit edition.

Though the source code is not well commented it is possible to extract subtle details of implementation
from it. This is considered to be useful since not all the details can be commented in the paper due to
space limitations.



Directory	Content
-------------------------
data		Contains experimental data used in the article.
		Data are in the raw text form as well as in the
		excel format (tables).

database	Contains solution database used by the BIBOX-theta
		algorithm for solving special cases of the problem of
		pebble motion on a graph.

source		Contains source code of all the tested algorithms, namely
		source code for BIBOX-theta algorithm and redundancy
		elimination algorithms are provided.