Simple Project List Software Download Map

136 projects in result set
LastUpdate: 2018-01-23 09:38

dlib C++ Library

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

LastUpdate: 2006-05-05 18:39


!PileWorks は、パイル技術のいくつかの側面にアプローチをいくつかの異なるプロジェクトを調整するための組織構造を提供します。!PileWorks は、インターフェイスのセットを定義し、杭エンジンとエージェントのいくつかの基本的なインフラストラクチャを実装します。

(Machine Translation)
LastUpdate: 2017-10-27 16:10

MOA - Massive Online Analysis

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

(Machine Translation)
LastUpdate: 2014-04-16 12:50

SimpleJ Games


LastUpdate: 2014-03-01 19:50

Open Hacking GateWay Client Crypto

この不正行為防止ソフトウェアはインタ フェース リアルタイム XTRAP 機能でチェックし、リモート サーバーにログを報告する S4 のリーグのクライアントによって使用されます。詳細情報: HGWC バージョン: 57 プロトコル バージョン: 7

(Machine Translation)
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: 2010-10-22 17:42


マイクロソフトは、もはやHaloをサポートしないので:PC用のコンバット進化は、私はこれは合法的だと言うことができます。しかし、あなたがこのゲームを所有している場合にのみ使用すべきです!このCDキージェネレータのプロジェクトはまだ始まっていない。 プロのリバースエンジニアが必要になります。

LastUpdate: 2015-01-10 06:23

HCRF library (including CRF and LDCRF)

隠れ状態 条件付確率場の C++と Matlabのライブラリ。LCDCRF、HCRF、CRFの3つのアルゴリズムを実装。 Windowsおよび Linux用。

LastUpdate: 2016-09-25 04:39


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

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: 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: 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-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: 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: 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)