Search Results for "gnu/linux" - Page 21
Sort By:
Showing 954 open source projects for "gnu/linux"
View related business solutions-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
A base set of libraries. Boilerplate type code and algorithms. Currently skuttil (Java util & parsing code) and searKit (generic Java search framework).
-
2
Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...
-
3
Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.
-
4
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
-
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
5
ngram is a module to compute the similarity between two strings. It is different to python's "difflib.SequenceMatcher" in that it cares more about the size of both strings. ngram is an port and extension of the perl module called "String::Trigram
-
6
The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.
-
7
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
-
8
-
9
-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
Boehm-Demers-Weiser Garbage Collector
Conservative "garbage collection" memory management library
The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc -
11
Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.
-
12
-
13
-
14
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
-
15
a simple software implemented FPU. only 32bit precision is supported and the operation result is not accurate as modern FPUs, but it is light and compact. (uses simple 32bit integer operations only, good for machines that has no hardware FPU.)
-
16
This component is an easing animation value calculator. Easing types: BackEaseIn, backEaseOut, BackEaseInOut, BounceEaseIn, BounceEaseOut, CircEaseIn, CircEaseOut, CircEaseInOut, CubicEaseIn, CubicEaseOut, CubicEaseInOut, ElasticEaseIn, ElasticEaseOu
-
17
-
18
NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.
-
19
SDL_Collide is a simple 2D collision detection library for SDL supporting pixel perfect collision tests between surfaces, bounding box collision checks and circle intersection routines.
-
20
-
21
Classroom allocation using Genetic Algorithms and restricted mutation. Developed by AIGroup: Pablo Cababie, Facundo Cancelo, Alvaro Zweig y Gabriel Barrera
-
22
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.
-
23
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.
-
24
plausj a collection of checksum algorithms used to validate business keys like bank account codes or credit card numbers. It's compiled as JVM bytecode files (although it's not necessarily implemented in Java) and can be used on JRE 1.5 and later.
-
25
A multi staged approach to the examination timetabling problem as described in the second International timetabling competition (ITC2007-2008)
