Search Results for "bin packing algorithm c"

headsort sorts files by line and fields. Options can pick field order and etc. In general headsort can sort in 1/2 the time sort(1) (mergesort) does in situations involving either pipes or mult column selection; less than 1/2 with both. Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done...

MaxBin2 is the next-generation of MaxBin (https://sourceforge.net/projects/maxbin/) that supports multiple samples at the same time. MaxBin is a software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users could understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome...

Estimates the maximum random close packing fraction of hard spheres with a distribution of diameters, based upon an algorithm in J. Chem. Phys. 131, 244104 (2009).

... on random time. The system never knows the time when a programm ask chaos.sh and what comes back because chaos.sh is affected by system speed the quarz and other stuff. It´s fuzzy. ---new update chaos.sh.7z--- Uses now access time and no calculation of system time anymore, so it is smaller and faster. copy it to /usr/bin and give read and execute permission to make it accessible globally in the system for every script. You can use c=`sh chaos.sh` to get the chaosbit into your script.

SpriteBuncher is a free, open-source texture packing program. It features an easy-to-use graphical interface, and advanced packing algorithms such as MaxRects. Further options include cropping, rotation, extruding, and padding. Data can be exported to a range of common output formats – e.g. Cocos2d, LibGDX, and Unity – or via generic XML, JSON, and plain text files. Examples and documentation are included. Source code available at: https://github.com/bazgt/SpriteBuncher [GPLv3].

... sequence alignments under the discrete-time Markov processes on phylogenetic trees, which samples directly from the transition matrices. Based on the input model and a phylogenetic tree in the Newick format (with branch lengths measured as the expected number of substitutions per site), the algorithm produces DNA alignments of desired length. GenNon-H is a collaborative project described at http://genome.crg.es/cgi-bin/phylo_mod_sel/AlgGenNonH.pl.

This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.

This project is an attempt to solve 3D Bin Packing Problem. That is basically is packing a set number of boxes to ONE bin. User interface runs on OpenGL using 'Quantum energy' engine which is developed as part of this project.