Search Results for "hash-linux" - Page 18
Sort By:
Showing 959 open source projects for "hash-linux"
View related business solutions-
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.
-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
1
-
2
Fastest string utility is java library (JAR ) for string operation . This library is very easy to use, very fast and very efficient in string operations such as split, toUpperCase, toLowerCase, replace, delete, regular expression and others.
-
3
Coupling the notion that during the search for the minimum of a function we must pass through its solution with a PSO solution generator engine, is the approach for solving, in time domain, a non-linear algebric-differential system of equations.
-
4
General purpose library (and some tools) that allows the construction of recursive deterministic/non-deterministic automaton from non-deterministic settings.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
5
Framework for development of simple evolutionary algorithms / island models programs in distributed environment using MapReduce programming model based on hadoop.
-
6
-
7
This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.
-
8
-
9
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
-
11
JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.
-
12
Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.
-
13
20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.
-
14
A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!
-
15
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
-
16
FM-index is a compressed text index appeared in 2000 (http://pizzachili.dcc.uchile.cl/indexes/FM-indexV2/). A recent algorithm allows to update a FM-index (http://dx.doi.org/10.1016/j.jda.2009.02.007). Here, you'll find the implementation.
-
17
Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.
-
18
MMLIB(Morfa Matrix Library) is a set of C++ numerical routines providing features similar to Matlab/Octave.
-
19
A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.
-
20
SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.
-
21
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.
-
22
SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.
-
23
clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.
-
24
-
25
Modules for developing, configuring and running a computation based on function blocks entirely in Python. Function block based computation is a data, event and state driven approach to data processing.
