Open Source C Algorithms - Page 7

Origin is a evolver for the programming game Corewars. Part of this project is a modified MARS (Memory Array Redcode Simulator) written in C especialy for evolvers. With SWIG its going to be very easy to use in different languages.

A P2P overlay construction toolkit, which supports routing algorithm researchers in addition to application developers. It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu

pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.

Package to handle Threads width PHP5

Membrane Computing is a new research area (within Natural Computing) that aims to provide computing devices abstracted from the functioning and structure of living cells. These devices are called P systems. The objective of this project (PMCGPU) is to bring together all the researchers working on the development of parallel simulators for P systems, specially those using the GPU (e.g. CUDA, OpenCL, etc). Other parallel platforms are also welcome (multicore and manycore, FPGAs, etc). This project has been initiated by the Research Group on Natural Computing (Department of Computer Science and Artificial Intelligence, University of Seville). PMCGPU was born inside the P-Lingua project, of the same research group. PMCGPU is a GNU project, so all the applications developed within it are released under the GPLv3 license. Just contact us if you want to participate. Please, visit the Wiki of the project for further information.

User friendly application with graphical interface, for creating and training a multi-layer feed-forward neural-networks. The application is intended for systems of GRID computation.

Library Of Randomized Algorithms: Randomization is a powerful idea has applications in science and engineering. Difficult optimization problems, protein folding and data mining are only a few of the problems that have been solved using randomization.

The PowerCiph Data Encryption Algorithm is a versatile, yet simplistic, encryption algorithm/protocol. The ultimate goal of the algorithm is simplicity, compactness, and a lack of prerequisites.

Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e estudo dos mesmos.

A library that does preform precise floating point operations designed for industrial / banking solutions.

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?

A whole lot of source code related to programming Linux systems with C

The project CIF now created with new philosophy of JPM (Joint Project Module) with SDK style. Now simply include CIF.h and use all of functions, macros and classes. BTS (Basic Text Support) Library Used in TOM (Text Object Module). TOM for now with CAnsiString , CAnsiStringLite And Text namespace. CAnsiString created with more functionality then typical string and text classes. EVS (Enhanced Visual Support) provide COpenFileDialog And CSaveFileDialog. JCM (Joint Core Module) used as base in project. Properly support for a class available TPT (Template Properly Type) and VTM (Value Type Macro). BTS,EVS,JCM,TOM,TPT,VTM are parts of project CIF. CIF5SDK used in project Bytes Counter. Project Core Information Foundation (CIF) is created by Muhammad Arshad Latti.

Schedule Tool is a utility for predicting the duration of projects from a series estimated task times. This tool converts the estimates to probabilities of success, and convolves successive tasks to give an estimated date of completion.

Promote is an easy to use, generic data structure and utility library for C,C++, and possibly more.

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.

Random Projection Trees is a recursive space partitioning datastructure which can automatically adapt to the underlying (linear or non-linear) structure in data. It has strong theoretical guarantees on rates of convergence and works well in practice.

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.

Ropes are a scalable string implementation that are designed for efficient operation by utilizing lazy operations such as concatenation and slicing. This is a python C module which implements ropes for pythons.

SCS - Simple Contest System - is a system for makieing Programming contests in simple way.

In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last 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/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst its space complexity is O(1). This algorithm checks two characters at a time. In best case where the substring is at the start of the text, we can check all the character of substring in only m/2 time. In worst case where the substring is at the last of the text, we need to iterate till n – m For more information please visit the following link:- http://learandexperiment.blogspot.in

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

SSEPlus is a SIMD function library. It provides optimized emulation for newer SSE instructions. It also provides a rich set of high performance routines for common operations such as arithmetic, bitwise logic, and data packing and unpacking.

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