Search Results for "java open source" - Page 8
Sort By:
696 projects for "java open source" with 2 filters applied:
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Context for your AI agentsBuild data pipelines that feed your AI models and agents without managing infrastructure. Crawl any website, transform content, and push directly to your preferred vector store. Use 10,000+ tools for RAG applications, AI assistants, and real-time knowledge bases. Monitor site changes, trigger workflows on new data, and keep your AIs fed with fresh, structured information. Cloud-native, API-first, and free to start until you need to scale.
-
1
IMPORTANT: The project moved over to github! You can find it at: https://github.com/exhuma/python-cluster
-
2
quadGT
Software package for the joint genotyping
quadGT is a software package for the joint genotyping of two parents, child’s normal genome and child’s tumor genome based on sequencing reads aligned to a reference genome. -
3
XSWAG (Extended SourceWare Archive Group) is a revival project for the famous SWAG code archives for the Pascal programming language. This project is open to every Pascal/Delphi programmer who wishes to contribute to the global Pascal knowledge base. Current version (testing 0.9) features : - a reader program : allows users to browse through the code archives, organizes them by type and operating system and updates the archives from multiple XSWAG servers. - a...
-
4
A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).
-
DAT Freight and Analytics - DATDAT Freight & Analytics operates DAT One, North America’s largest truckload freight marketplace; DAT iQ, the industry’s leading freight data analytics service; and Trucker Tools, the leader in load visibility. Shippers, transportation brokers, carriers, news organizations, and industry analysts rely on DAT for market trends and data insights, informed by nearly 700,000 daily load posts and a database exceeding $1 trillion in freight market transactions. Founded in 1978, DAT is a business unit of Roper Technologies (Nasdaq: ROP), a constituent of the Nasdaq 100, S&P 500, and Fortune 1000. Headquartered in Beaverton, Ore., DAT continues to set the standard for innovation in the trucking and logistics industry.
-
5
HL7 to XML Transformation toolkit. Using HL7 v2 XML
-
6
parFE is fully-parallel high-performance finite element code targeted to the modeling of trabecular bones in humans. It employs scalable multigrid solvers for efficient solutions on massively parallel computers.
-
7
-
8
QMC Logic Minimizer
combinational logic functions minimization
QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output... -
9
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library -
Create and run cloud-based virtual machines.Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.
-
10
-
11
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
12
La suite logicielle Monia est destinée à l'apprentissage de l'algorithmique en français. Elle permet de fabriquer un exécutable à partir d'un organigramme, en passant par un programme procédural écrit en pseudo-langage.
-
13
A bignum library written in the C++ programming language as templates. It provides standard mathematical operations like add, sub, mul, div, pow etc. with the big integer and big floating point numbers.
-
14
gundercrypt [MOVED]
A CLI text encrypting/ciphering program and library for java
** MOVED: to github.com/gundermanc/gundercrypt A CLI text ciphering program and library written in java that makes use of pseudo random numbers and a password (provided by the user) to generate encrypted text by selectively shifting each subsequent letter by a pseudo-random index, encoding it as a letter stored in a hidden position within the String, and then re shifting the encrypted String again by numeric values deduced from a password to provide a dual layer of security. Easily can be... -
15
Carnaval est un logiciel destiné au calcul de masques et d'ensoleillement. La version actuelle permet de calculer les trajectoires solaires et les masques de terrain liés au relief (modèle issu des données SRTM). Les développements ont été repris par Sober Software. Merci de visiter ce site pour télécharger la dernière version et accéder aux nouvelles fonctionalités : www.sober-software.com
-
16
Search Agents - a framework for collaboration of meta-heuristic agents
-
17
This is a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any structure having a unique, arbitrarily-typed key member can be hashed by adding a UT_hash_handle member to the structure and calling these macros.
-
18
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue... -
19
Evolving Objects
This project have been merged within Paradiseo.
See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/) -
20
CADI is an implementation of the JPIP standard (JPEG2000 Interactive Protocol - Part 9). CADI includes a JPIP server, a JPIP proxy, and a JPIP Client. CADI is designed and programmed with the aim to provide a flexible framework to test and develop ne
-
21
A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.
-
22
This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.
-
23
-
24
Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator
-
25
Sorting Algorithms
An educational demo of how sorting algorithms work.
This is a small Java swing application that shows different sorting algorithms working on the same set of data. The user can modify the speed of execution and the type of data to sort and execute it step by step. The tooltip of each algorithm's box shows the source code that is executed and a little explanation got from wikipedia. This application is aided to computer science students who want to better understand how the algorithms work.
