Partition problem From Wikipedia, the free encyclopedia
In computer science, the partition problem is an NP-complete problem. The problem is to decide whether a given multiset of integers can be partitioned into two "halves" that have the same sum. More precisely, given a multiset S of integers, is there a way to partition S into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the...
This was written as an underhanded solution to an problem in an online programming challenge (http://www.spoj.pl) that required converting simple arithmetic expressions from infix to postfix form. I thought the solution was pretty neat, and I...
This file contains MATLAB functions, m-files, that do Huffman coding and arithmetic coding of integer (symbol) sequences. Complete coding may be done by calling an easy to use main program (or main function), where input argument is the sequences...
Arithmetic coding and decoding for Text Compression
It calculate the arithmetic code of a string of char, subject to an alphabet "A" and a probability distribution "P". http://en.wikipedia.org/wiki/Arithmetic_coding
It is a matlab function that codes a string of char with Arithmetic coding.
res=arithmetic_code(alphabet, distr_pr, string)
'alphabet' is a vector that contains the char used in the string 'string'; 'string' is the string to...
The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm....
A Lambert-orbital boundary value problem can be stated as
"Find the orbit/trajectory of a spacecraft that flies from position [r1] to [r2], taking a time [tf] and making [m] complete orbits before arriving at [r2]. "
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the count of each item to include in a collection so that the total weight is less than or equal...
We present a set of functions based on interval arithmetic to solve small size global optimization problems with guaranteed bounds on solutions. Interval analysis can be used to bound ALL solutions of nonlinear optimization problem, equality...
This is a program that generates a test problem for linear optimization with a sparse matrix. The test problem is of the kind
min c'*x s.t. Aeq*x=beq lb<=x<=ub
where lb is a zero vector and ub is greater then...
Polar Crypto is an easy to use data protection tool for software developers. You can use this ASP data security package to encrypt, decrypt, data hash, sign tasks. The powerful cyrptodata object available in the software first encapsulates all...
Crypto Anywhere is secure email on the move ! Users can decrypt and encrypt messages to friends who use PGP, OpenPGP, SecExMail and many more. Crypto Anywhere allows you to make a travel floppy which can be used in internet cafe's or at work. You...
PR-Tracker is an enterprise level problem tracking system designed especially for bug tracking. PR-Tracker is easy to use and setup. It has a sensible default configuration so you can begin tracking bugs right away while configuring the software...
Crypto Obfuscator For .Net 2009 provides advanced code protection, obfuscation and optimization for your .Net assemblies. Crypto Obfuscator combines powerful obfuscation, encryption and optimization techniques to provide the very best...
It's a simple solver of the problem of Hanoi Tower with a minimal GUI written in wxPython. It can handle just 10 plates, due to windows size..however it's very simple to modify this and the 'pure' solver is not affected by this limitation
Longest common subsequence problem is a good example of dynamic programming, and also has its significance in biological applications.
For more information about LCS, please see:
The transhipment problem is to minimise the cost of transporting goods between various sources and destinations.
A simple but slow way of compression using arithmetic coding.
Botan is a BSD-licensed crypto library written in C . It provides a wide variety of cryptographic algorithms, formats, and protocols. |