Simple Project List Software Map

135 projects in result set
LastUpdate: 2020-08-09 04:35

dlib C++ Library

ネットワーク、スレッド(メッセージパッシング、futures, 他)、グラフィカルインターフェイス、データ構造、線形代数、機械学習、XMLとテキスト解析、数値最適化、ベイズネット等を扱う移植可能なアプリケーションを開発するためのライブラリ。

LastUpdate: 2013-10-14 00:34


DDMTestbed は、テストベッド ランダムなインスタンスを生成し、実行時間、占有されていたメモリに最適なソリューションからの距離を測定 resolutive 提案手法を評価することができます。C 言語で書かれています。

(Machine Translation)
LastUpdate: 2007-09-20 15:36

TA-Lib : Technical Analysis Library

ADX、MACD、RSI、ストキャスティクス、TRIX といった指標を含む、テクニカル分析ライブラリ。

エンドユーザー向けの GUI によるトレードツールやチャート表示ツールではありません。 Excel、.NET、MONO、Java、Perl や Python や C/C++ といったものを使用するアプリケーション開発者向けです。

LastUpdate: 2016-09-25 04:39


lp_solveは、混合整数線形計画法 (Mixed Integer Linear Programming, MILP)のソルバーであり、純粋な線形、(混合)整数/バイナリ、半連続、特別な指示によるセット(SOS)モデルなどへ解を与えます。lp_solveは、ANSI Cで記述され、LinuxやWindowsのような多くの異なるプラットフォーム上でコンパイルすることができます。

LastUpdate: 2014-04-16 12:50

SimpleJ Games


LastUpdate: 2014-05-16 02:43

The Sound of Sorting

The "Sound of Sorting" is a demo program containing many integer sorting algorithms. The algorithms are visualized in real time and augmented with sound effects, which are based on the values being compared. Animation speed and sound sustain can be customized while the algorithm is running. The visualization also highlights the algorithm's internal workings, which makes the demo program very useful for teaching sorting algorithms in an undergraduate computer science course. The program also counts the number of comparisons done by an algorithm, which can then be compared to the analytically derived value. The demo is implemented using the cross-platform toolkits wxWidgets and SDL, and can be executed on Windows, Linux, and Mac.

(Machine Translation)
LastUpdate: 2020-07-29 18:41

MOA - Massive Online Analysis

例については、データ ストリームの連続的な供給からの学習のためのフレームワーク。分類とクラスタ リング手法が含まれます。プロジェクトに関連する、ウェカ、またより厳しい問題に拡大縮小しながら、Java で書かれています。

(Machine Translation)
LastUpdate: 2009-12-29 02:11


Classless.Hasher is a collection of standard hashing and checksum algorithms implemented within the .NET framework (Microsoft, Mono, etc.). It provides a uniform interface to easily use any of the algorithms contained within this library in other programs.

LastUpdate: 2014-02-02 22:25


libefgy is a set of C++ headers containing lots of templates loosely related to maths. The headers include templates for fractional arithmetic, big integers (and thus "big fractions"), calculating π, e, and some calculations with those (for trigonometrics), matrix manipulations, tuples, polar and Euclidian spaces in arbitrary dimensions, (perspective) projections, colour space manipulations in RGB and HSL, and assorted other things.

(Machine Translation)
LastUpdate: 2013-12-08 21:10

TSP Solver and Generator

TSPSG is intended to generate and solve "travelling salesman problem" (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using the Branch and Bound method to solve a particular task.

LastUpdate: 2014-02-22 23:56

C Almost Generic Library

C Almost Generic Library (CAGL) is a set of C macros which generates typed arrays, lists (singly or doubly-linked), hash tables, and balanced binary trees, as well as many useful functions to manipulate them. The containers grow automatically, and their memory is managed by the library. The container data, or elements, may also be managed by the library, depending on the options specified by the programmer. The aim is to free C programmers from the drudgery of implementing common data structures and algorithms. CAGL also provides some safety by making the containers typed instead of void pointers. Although, at most, two macros are invoked to declare and define a container type, manipulation of the containers is done using functions generated by the macros. A simple naming convention is used to get around the limitation that C doesn't support function overloading.

(Machine Translation)
LastUpdate: 2009-04-12 17:17

Algorithm Study

Algorithm Study provides tools and resources to augment the traditional study of algorithms. It includes implementations of common and less-common algorithms in a variety of languages and visualization tools to help in gaining a deeper understanding of the algorithms. The algorithm implementations are each accompanied by a discussion of the asymptotic ("big O") run time and memory limits of the algorithm. Some implementations include discussion of how the algorithm or data structure is commonly used and comparisons with similar algorithms or data structures. All implementations have test cases that exercise their functionality. The visualization tool, Algorithm Visualizer, displays what happens as various algorithms do their work.

LastUpdate: 2012-07-10 01:06


nedtries is a portable in-place bitwise binary Fredkin trie algorithm that allows for near constant time insertions, deletions, finds, closest fit finds, and iteration. It is approximately 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables. It provides implementations as C macros, C++ templates, and as a C++ STL compatible associative container.

LastUpdate: 2013-09-25 21:03


llrb.h is an iterative implementation of Robert Sedgewick's 2-3 variant left-leaning red-black tree algorithm. It's written to be a drop-in replacement for Niels Provos' <sys/tree.h> C preprocessor red-black tree library.

(Machine Translation)
LastUpdate: 2015-04-21 04:32


libmng-リファレンス ライブラリを読み取り、表示、書き込み、および複数画像ネットワーク グラフィックスを調べるします。MNG は、アニメーション拡張子を人気のある PNG 画像形式です。

(Machine Translation)