Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

tpie

Compare

  Analyzed about 11 hours ago

The TPIE (Templated Portable I/O Environment) library is a tool box providing efficient and convenient tools to ease the implementation of algorithm and data structures on very large sets of data.

77.7K lines of code

3 current contributors

8 months since last commit

2 users on Open Hub

Very Low Activity
0.0
 
I Use This

JSTS Topology Suite

Compare

  Analyzed about 18 hours ago

The JSTS Topology Suite is a JavaScript library of spatial predicates and functions for processing geometry conforming to the Simple Features Specification for SQL published by the Open Geospatial Consortium. JSTS Topology Suite is also a JavaScript port of the well established Java library JTS ... [More] Topology Suite with a built in parser for OpenLayers geometries. [Less]

36.2K lines of code

2 current contributors

about 1 year since last commit

2 users on Open Hub

Very Low Activity
5.0
 
I Use This

Generic STL

Compare

  Analyzed 1 day ago

A generic implementation of STL containers and some STL algorithms. It is absolutly independent from external types it use only types declared in type_traits. So containers can be used with any poiner types which satisfies PointerConcept.

37K lines of code

0 current contributors

almost 13 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

CRM114 for Ruby

Compare

  Analyzed 28 minutes ago

Ruby interface to the CRM114 Controllable Regex Mutilator, an advanced and fast text classifier that uses sparse binary polynomial matching with a Bayesian Chain Rule evaluator and a hidden Markov model to categorize data with up to a 99.87% accuracy.

197 lines of code

0 current contributors

almost 16 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

igraph library

Compare

  Analyzed about 21 hours ago

This is another library for creating and manipulating graphs. There is simply no other graph library out there which can be handle graphs of the size the author is confronted with efficiently. Whenever possible igraph tries to be also user friendly and portable. igraph started as an additional ... [More] package to the GNU R statistical environment, and still some functions which are hard to implement in C are available only in R (like interactive graphics). Most functions are however now written in C and they can be compiled without R as a separate library. [Less]

728K lines of code

16 current contributors

7 days since last commit

1 users on Open Hub

Very High Activity
5.0
 
I Use This

Starlink

  Analyzed 1 day ago

The Starlink Project was a UK astronomical computing project which supplied general-purpose data reduction software.

4.94M lines of code

7 current contributors

4 days since last commit

1 users on Open Hub

Low Activity
0.0
 
I Use This

EvoSynth

Compare

  Analyzed about 14 hours ago

EvoSynth (Evolutionary Computation Synthesizer) is a framework for rapid development and prototyping of evolutionary algorithms.

8.04K lines of code

0 current contributors

over 14 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

Cryptolysis

Compare

  Analyzed about 3 hours ago

A Java framework for testing heuristics in breaking classifcal ciphers.

3.42K lines of code

0 current contributors

about 13 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

TSP Solver and Generator

Compare

  Analyzed about 12 hours ago

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 ... [More] 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 Branch and Bound method to solve a particular task. [Less]

6.14K lines of code

0 current contributors

over 9 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

Java Genetic Algorithm Library

Compare

  Analyzed about 7 hours ago

An object oriented library of an Genetic Algorithm, implemented in Java. Clear separation of the several concepts of the algorithm, e.g. Gene, Chromosome, Genotype, Phenotype, Population and Fitness Function. The fitness calculation is parallelized.

77.5K lines of code

1 current contributors

3 months since last commit

1 users on Open Hub

Moderate Activity
5.0
 
I Use This