Search Results for "b-tree implementation"

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

- - - T H I S P R O J E C T M O V E D T O G I T H U B - - - A framework for the implementation of advanced real-time control systems which uses signal/block-based schematics (like Simulink) extended by several features like state machines and online-exchangeable sub-simulations. Besides, this framework properly handles multiple threads, their communication, allows to synchronise control systems to external events (e.g. variable timers or incoming network packages) and provides many other nice features. ...

These are the implementation of various parallel algorithms like Symmemtric division for sum and maximum, Optimal sum using parallel algorithms, List ranking, Tree contraction, Matrix vector multiplication, Counting the number of vowels, consonants, digits, Matrix transpose, Block based matrix multiplication, the project folder has 4 implemenations of Matrix Multiplication algorithms, one simple muliplication, Transpose based multiplication, Strip based matrix mulitiplication

This is the first implementation of QueLang. QueLang is a language I designed for Questionnaire Design and Implementation. This software can compile your code (written in .ql text files) into a special .qlc format (a kind of database). Then it can read those .qlc files to open them in viewer and export them to PDF format. It can be also used for exam and test designing! Tested on: -Linux Ubuntu 12.04 -Windows 7 64-bit QueLang can run by double clicking the .jar (or .exe)...

aztree library is an implementation of most types of tree data-structure in C language. The library will implement these different type of trees. Binary, Self-balancing binary search, B-trees, Tries, BSP, Non-binary and few used in Computer Graphics