This is an intelligent Sudoku solver in c++. It is intlligent, because it uses several logical deduction methods, just like a person, before resorting to guessing. I was trying to teach my kids Sudoku, and taught a computer as proof of concept.
OnuriS (Open soURce wImax Simulator) is a simulation platform designed for WiMAX in order to analyze network performances and develop particular allocators for better bandwidth allocation strategies that could greatly improve the overall system.
An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.
Sterobil is a project used to build a 3D model from photographic pictures, based on the principle of photogrammetry. This project was developped by ECE students, in collaboration with the C2RMF.
The C++ library Geneva allows to run large scale parametric optimization problems. It can run in serial or multi-threaded mode or in a networked environment. The library currently covers Evolutionary Strategies, Genetic Algorithms and mixed scenarios.
Example how to use my class TPluginObject in C++Builder5 projects. Call *.bat, *.exe, *.vbs, *.hta, *.dll as plugins from application events or main menu. Create data base "PluginSampleDB" in MS SQL Server 2005 and Imort ActiveX : ScriptControl
Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform.
Geographic restrictions, eligibility, and terms apply.
A cross-platform library that computes fast and accurate SIFT image features. libsiftfast provides Octave/Matlab scripts, a command line interface, and a python interface (siftfastpy). Optimized with SIMD instructions and OpenMP .
ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
EasyGenetic is a highly efficient C++ framework for genetic master-slave algorithms. It heavily makes use of template metaprogramming to provide a fully customizable environment that accommodates most of user's needs without sacrificing efficiency.
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
Kuhn-Munkres is used inside assignment problem solver application. Instance generator application creates input file for the solver. Checker application verifies the solution computed by the solver. A bash script compiles, executes these apps.
This project implements insert and remove operations on AVL trees. Comments in the source explain the implementation. Test applications perform a run-time check of insert and remove methods. A bash script builds and executes the test applications.
The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.
AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.
A library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a GUI for manipulating and editing of graphs.
Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys