Search Results for "java algorithms" - Page 11
Sort By:
Showing 855 open source projects for "java algorithms"
View related business solutions-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
1
EASEA (EAsy Specification of Evolutionary Algorithms: pronounce "easy") is a high-level language dedicated to the specification of evolutionary algorithms. EASEA up to version 0.7 compiles .ez specification files into C++ or JAVA object files.
-
2
...Also, you can use the following command line: Java -Xms1500m -jar "ML Library.jar" to ensure that the java virtual machine has enough space to run. You can find sample test files under code/Test. Test files for clustering part are under code/Test/InputFile which contains two chameleon datasets from: http://glaros.dtc.umn.edu/gkhome/cluto/cluto/download Also, you can find sample test files for self-learning and co-training under its corresponding folders.
-
3
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,... -
4
ontocomp
OntoComP is a Protégé 4 plug-in for completing OWL ontologies
OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has... -
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
This library aims to provide support for D-dimensional images in Java and to enable high-level implementation of algorithms in dimensionally-invariant manner. Major features: the dimensionality and the access to primitive data types are abstracted.
-
6
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
7
-
8
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (<... -
9
JConstraints
Java Framework to implement solutions to solve constraints problems
...Just to name a few algorithms, the Framework can solve any constraints problems using: - Regular Backtracking; - A variety of Backjumping algorithms; - A variety of arc-consistency algorithms; - Local search algorithm; - Tabu search algorithm; - Maximize solutions: comming soon; - Minimize solutions: comming soon; The Framework also enables heuristic injections so that the developers can achieve greater performance of algorithms using their own heuristics. ... -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
Concurrency Freaks
A library with Scalable (and fast) Read-Write locks
This library contains Java code for several Read-Write Locks: - ScalableRWLock: A rw-lock that scales with the number of threads doing read-lock. - ScalableRWLockS: Similar to above but different implementation. - ScalableStampedRWLock: An hybrid of the ScalableRWLock and the StampedLock provided in JDK 8, which provides good overall performance. - FAARWLock: Uses a Fetch-And-Add operation for the read-lock which means it is not so scalable as ScalableRWLock but it is still faster than... -
11
thecodemonkey's JBase64
free and fast implementation of a Base64 coder for Java
This is a completely free (as defined by the Free Software Foundation), fast implementation of a Base64 coder for Java developers as replacement for the SUN proprietary library -
12
cmotif
A method for mining conditional phosphorylation motifs
Phosphorylation motifs represent position-specific amino acid patterns around the phosphorylation sites in the set of phosphopeptides. The discovery of phosphorylation motifs is a very valuable work in bioinformatics. Although several algorithms have been proposed to uncover phosphorylation motifs, the problem of efficiently discovering a set of significant motifs with sufficiently high coverage and non-redundancy still remains unsolved. In this paper, we propose an algorithm called C-Motif... -
13
Cost-sensitive Classifiers
Adaboost extensions for cost-sentive classification
Adaboost extensions for cost-sentive classification CSExtension 1 CSExtension 2 CSExtension 3 CSExtension 4 CSExtension 5 AdaCost Boost CostBoost Uboost CostUBoost AdaBoostM1 Implementation of all the listed algorithms of the cluster "cost-sensitive classification". They are the meta algorithms which requires base algorithms e.g. Decision Tree Moreover, Voting criteria is also required e.g. Minimum expected cost criteria Input also requires to load an arff file and a... -
14
The Edlin toolkit provides a machine learning framework for linear models, designed to be easy to read and understand. The main goal is to provide an architecture and easy to edit working examples of implementations for popular learning algorithms.
-
15
It is a framework for testing various revisitation algorithms on real datasets. Some algorithms have already been implemented and are available for testing. Additional algorithms can be added by users and evaluated on this test bed.
-
16
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
17
Fileprivacy
Fileprivacy easily encrypts your files
Fileprivacy is a small tool which easily encrypts and decrypts files with common algorithms like AES, Blowfish, Triple DES and RSA. You can either use passwords or keyfiles. Since Fileprivacy is coded in Java it should run on all popular operating systems. #######BETA 2####### Bugfix - Beta 1 stopped working if filename was too short or long - added .exe file ####### NOTE ####### This is an early beta implying there are some issues left. -
18
Linux Dudes Library
Library containg a set of various classes for java
This library contains a set of classes that performs a various set of operation in java programming language. This operation includes searching and sorting algorithms used with arrays and a cache management system that is designed to be simple and easy to use -
19
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. ... -
20
ktree
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja. -
21
JCryptor
JCryptor is an encrypting tool based on the Caesar-cipher.
JCryptor uses the Caesar-cipher to encrypt keystrokes on-the-fly. It can also be used to decrypt an encrypted text easily. Caesar-cipher is a simple encryption algorithm, developed by Julius Caesar, to encrypt his correspondence with Cicero in the ancient world. Therefore it uses a simple character substitution method to replace a given character by another. A keyshift of thirteen is called ROT13. ROT13 can be decrypted by encrypting it again with ROT13. Even today this simple method is used... -
22
Linking AnalyzerTask for iQser GIN
niPRO AnalyzerTask to calculate link popularity
AnalyzerTask to calculate the link popularity (SIN LP) for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project. -
23
it's an Java Desktop application that implements many encryption algorithms. 1-RSA 2-El Gamal 3-Hill 4-Vigenere 5-DSA
-
24
Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e...
-
25
Image Sorter
A visual animated demonstration of two sorting algorithms
An applet designed to demonstrate visually the steps taken by two sorting algorithms -- Insertion sort and Selection sort.
