Open Source C Algorithms for BSD - Page 4

Moving target detection in 2D using Kalman Filter written in JS for demo purposes.

Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library.

Multicore SWARM (Software and Algorithms for Running on Multicore Processors) is an open source library for developing efficient and portable implementations that make use of multi-core processors. David A. Bader (Georgia Tech) began SWARM in 1994.

libmgcd is a multigrid contact detection (MGCD) library.

Generic System for Data Processing

This library implements a thread-safe skip list data structure - a kind of list with good insertion, deletion and searching performances. It uses Fred Fish's dbug library as internal tracing/debugging system. See the web site for more details.

Open Source HSI and other display forms for use in small panel mount displays.

Open Macro Library is a library of highly reusable C macros providing a set of well-designed commonly needed functionality to C developers, like logging and debugging helpers, containers, sorting and other algorithms.

Open Object Oriented ANSI C provide API to build Object Oriented application in ANSI C language. It provide common base classes that allow inheritance to develop application with your own reusable objects, and smart exception recovery support

Automated computer program grading solutions designed for trainings on computer languages, data structures and algorithms. See http://openjudge.net for details.

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.

Package to handle Threads width PHP5

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.

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

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.

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.

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++.

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

Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. NO tool is providing a global framework to develop algorithms. Silicis is a new formal framework for designing [verification] algorithms.

SimpleDomino is a Server for a Programming Competition from Schoolinux and Linux-dubai.com for School Students. It uses TCP/IP for Communications. (It's base on Linux but can port to Windows) You can start your own Competition or Help us to develop this P