Search Results for "java implementation loader" - Page 2
Sort By:
Showing 61 open source projects for "java implementation loader"
View related business solutions-
MongoDB 8.0 on Atlas | Run anywhereMongoDB 8.0 brings enhanced performance and flexibility to Atlas—with expanded availability across 125+ regions globally. Build modern apps anywhere your users are, with the power of a modern database behind you.
-
Get Avast Free Antivirus | Your top-rated shield against malware and online scamsOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
1
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.
-
2
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.
-
3
http://jocdelavida.piposerver.com - Online implementation of Conway's Game of the Life 0 players game, but using entities based on the nature, like animals or plants who born, grow up, reproduces breed and die. Written in Java 6 and Adobe Flex 3.
-
4
Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
All pairs shortest path implementation using iterative mapreduce paradigm. Specifically, the iterative paradigm is an implementation of Twister (www.iterativemapreduce.org), developed by Indiana University.
-
6
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.
-
7
Implementation of Damerau-Levenshtein fuzzy string matching in Java. Returns the distance adding one point per character insert, deletion, mismatche and swap.. This is an extension of apache/commons/lang/StringUtils.getLevenshteinDistance()
-
8
Fuzzy numbers and basic fuzzy arithmetics (+, -, *, /, 1/x) implementation written in Java. Should be used as a library, but it also has a GUI which demonstrates its capabilities (using SWT widgets).
-
9
Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. JTLV is a new tool aimed to facilitate and provide a unified framework to the development of formal verification algorithms.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.
-
11
An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
-
12
ACMgen is an automatic code generator of Asynchronous Communications Mechanisms based on the generation of Petri nets models that can be formally verified against some properties and then transformed into a real implementation (e.g. C++ or Verilog).
-
13
This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.
-
14
The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.
-
15
-
16
JKalman is an Open Source Java implementation of Kalman filter. Kalman filter is an efficient computational (recursive) tool to estimate the dynamic state of a process in a way that minimizes the mean of error.
-
17
OpenNeuron is a neural networks implementation written in Java. Currently supports only Kohonen Network model, but API is designed to be easily extended to model other network types. This implementation was used for face thermal pictures recognition.
-
18
-
19
JNSGA2 is a Java library with an implementation of the multi-objective genetic algorithm NSGA-II published by Deb et al.
-
20
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.
-
21
VisualSort is a Java application for visualizing the way different sort algorithms work. Its implementation makes it easy to add new sort algorithms.
-
22
General purpose state observation library for Plan Old Java Objects. It enforces Model-View-Controller paradigm, has well defined API and set of ready made implementation algorithms.
-
23
Project Tokaf is an general implementation of top-k algorithm. It provides interfaces for all modules that are needed. It also features user preferences module, for computing new preferences and manipulating existing ones.
-
24
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
-
25
A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.
