Search Results for "software testing projects" - Page 3

The purpose of the project is summarising effort from a number of analytic libraries, adding interactive web-based user interface and making a free open source solution for risk analytics and stress testing. Feb 8, 2012 Paul Glasserman's Importance Sampling and Tail Approximations as well as plain Monte Carlo have been implemented for for the widely used normal copula model of portfolio credit risk. The package includes source code, examples, spreadsheet with results and references to the papers.

The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue...

Free Java Flowchart simulator / interpreter

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

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 this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/

This project is primarily for testing and demonstrating ideas for an ultimate programming system, though it might very well become a very usable programming system in time. It is being developed with PowerBasic's PBWin7 compiler.

Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.

Some tools for discussion about algorithms. 1) an evaluating tool for complexity

ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.

Free and easy to implement algorithm that can be used for resource leveling in Gantt projects. Uses resources assignment policies, availibility calendars, tasks\' priorities, dependencies, sizings, complexity due to human communication.

SWARD (System for Weapon Allocation Research and Development) is a testbed for benchmarking weapon allocation algorithms against each other. It is intended for researchers within operations research, information fusion, and related areas.

Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.

Libface is a cross platform framework for developing face recognition algorithms and testing its performance.

Interval Container Library (ICL): An STL based generic library for computations on intervals, interval containers and cubes

Battle Code/Engine made in PHP and intended for browser games. Version 1.0-beta released after some testing. The homepage now links to the simulator available in the files.

This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.

This project is no longer maintained. Instead use my Java util lib: http://sourceforge.net/projects/util-lib/

FPM - Fixed Point Math substitutes expensive floating point operations by much cheaper integer arithmetics. Use this library in your plain C (gcc) projects if you like.

This is a tidy lightweight library implementing a series of C++ Design Patterns, aiming to be simple, clean and portable. This library is made to help C++ programmers to develop projects with clearer and more compact source code.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.

This projects has the intent to take any file that has a header and any number of lines, take out the blank lines, the carriage return and the line feed, given as delimitation the "project number" format and generates a new clean file.

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

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning