Search Results for "hash-linux" - Page 30
Sort By:
Showing 959 open source projects for "hash-linux"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
$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.
-
1
This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.
-
2
TAROT is a easy-to-use framework for Monte Carlo simulations in python. Calculations between different kinds of randomly distributed numbers are made as easy as basic arithmetics. Tarot provides an interactive graphical interface for interpretation.
-
3
Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.
-
4
Robust Perl OO Module for Digest based Authentication leveraging DBI as a backend. This Performance oriented Hash Authentication Library is scalable from single pc to multi-database single signon www applications. Optionally uses Javascript and Cookies.
-
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.
-
5
This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.
-
6
Grupo de librerías para implementar tipos abstractos de datos completamente orientados a objetos, y tambien manejo de grafos.
-
7
spdict is a library of dictionary algorithms written in C++. It has support for sorted array, binary search tree, red-black tree, skip list, and balanced tree algorithms. Also include a cache class.
-
8
Depends implements a generic dependency tracker written in C++ and comes with extensive documentation on how to implement a dependency tracker (and, thus, how this one is implemented). It is very simple to use and provides the tools to "roll your own"
-
9
Java Framework for automatic transformation of graph structured Process Models (incl. BPMN import) to block structured BPEL code. A graphical tool is provided for visualisation and testing.
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
10
PyPlayground is an environment for developing algorithms involving movement in a space of up to three dimensions using Python.
-
11
VisualSort is a Java application for visualizing the way different sort algorithms work. Its implementation makes it easy to add new sort algorithms.
-
12
-
13
A portable C++ library of multi-threaded STL algorithms (transform, accumulate...) using standard containers and iostreams. Thread, mutex, spinlock are templatized. Close to Intel Threading Building Blocks, HPC++ or PSTL. Idea of A.Stepanov and M.Austen.
-
14
SweenJet helps developers to create Java applications. It provides constrained models, useful Swing components (e.g. splash screen, input fields), actions, look-and-feel enhancements (e.g. themes, multi-line tooltip), and a complete preferences system. This project is no longer actively developed.
-
15
A C++ library for Bayesian computation, including a collection of more generally-applicable utilities.
-
16
This is an image coder with fixed sampling, at a rate of up to 24 images per second (on XC2V1000-4 @ 40 MHz with res. up to 352x288).
-
17
Fugu is a small C++ library of generic components for computer graphics applications. It's written on top of boost.
-
18
quiplib is a c++ library that contains some classes to simplify you network programing and ACE programming. And implement some important and useful patterns in templates
-
19
This project provides some hyperheuristics, implemented as C libraries. A hyperheuristic can be used to handle any optimization problem, as long as you implement some simple specific code to interact with it. Some examples/applications are also provided.
-
20
Toolbox for Java developers. Includes right now only a multi-layered extensible cache system but will grow depending on requirements.
-
21
Fiona is a tool to automatically analyze the interactional behavior of a given oWFN. It provides two techniques: it checks for the controllability of the given net by computing the interactiong graph and it calculates the operating guideline for the net.
-
22
JCortex is a complete solution that allows software developers create, educate and use Artificial Neural Networks in Java projects. Splits in two elements: JCortex Framework, an ANN Java framework; and JCortexBuilder, its graphic development environment.
-
23
JSONER is a JavaScript library intented to simplify most used operations with JSON based on event API on JSON tree. It includes: data lookup and binding solution, HTML form by JSON dynamically creation and population, transformation and comparison JSONs.
-
24
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
-
25
The Distributed Genetic Programming Framework is a scalable Java genetic programming environment. It comes with an optional specialization for evolving assembler-syntax algorithms. The evolution can be performed in parallel in any computer network.
