Package to handle Threads width PHP5
PAK is a collection of library code to handle the overhead of coding
PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below...
PPFN, it is also a tool to be hidden from any server log, these developers know what they have to do. Do you? If you download this ultimate package you will be able to enjoy the web knowing that you would be safe. So be safe, learn to surf right - PPFN
pvmfractal is a highly customizable fractal viewing application, that can work interactively as an SDL or Curses app, or in batch mode as a console app. It includes many coloring algorithms, layers, and can use multiple computers for calculation using PV
PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.
Raiden block cipher: An extremely lightweight and fast block cipher, developed using genetic programming, with the intention to be an alternative to TEA. This cipher is as fast as TEA, and without many of its known weaknesses.
A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.
SenseRank Sys: - builds the dictionaries (multidim matrices) of words’ values; - for the set utterance in certain language builds a figure in multidimensional space (in the matrix space) of values (visual schema), which is topological view of sense
One approach to constructing fast queues is to construct a mechanism for using shared memory appropriate containers in C++ as templates. There are three main components: the shared segment of memory, an allocator of memory chunks and the queue itself.
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases best, average and worst its space complexity is O(1). For more information please visit the following link :- http://learandexperiment.blogspot.in
Solving the Travelling Salesman problem is not our objective. We are writing an algorithm which will sort out the traffic woes of transport companies. In turn, it will help in saving traveling cost and time for the people involved and the transport compa
This package provides implementations of various sketching techniques (a.k.a. synopsis). In particular: Bloom filters, Lossy Counting, FM, AMS, Count-Min, Max-Stable and Range-Efficient sketch, Quantile Digest, Reservoir and Counting Sampling.
Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.
This project has moved to GitHub: https://github.com/pvaret/spyrit
The package implements a variety of tools for categorization of multivariate data such as boosted decision trees, bagging and random forest, bump hunting (PRIM), a multi-class learner and others.
This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.
TAC-AI is an infantry combat simulator using XML to store unit status, and pluggable AI modules to make strategic and tactical decisions. Replace the default TAC-AI modules with your own and see how your forces perform against an opponents logic.
Transsat makes it possible to use unary and binary coding in SAT-related problems. Furthermore it introduces a convenient file format to input integer-based constraints and you can choose between popular SAT-solvers.
To provide a service that enables the user to view the related documents in a “see also” link that views the similar topics related to the current topic. To provide a system capable of viewing similar articles on the internet.
WORDFIELD is an extremely fast incremental word list generator. It's meant for use with a password recovery tool such as John the Ripper or aircrack-ng.
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
XAUST - Xml compression using AUtomata and STack
extend what db2 can do. developer and dba helper.
Some tools for discussion about algorithms. 1) an evaluating tool for complexity