Search Results for "for java" - Page 5
Sort By:
Showing 491 open source projects for "for java"
View related business solutions-
Skillfully - The future of skills based hiringSkillfully transforms hiring through AI-powered skill simulations that show you how candidates actually perform before you hire them. Our platform helps companies cut through AI-generated resumes and rehearsed interviews by validating real capabilities in action. Through dynamic job specific simulations and skill-based assessments, companies like Bloomberg and McKinsey have cut screening time by 50% while dramatically improving hire quality.
-
The AI coach for teams, built on validated assessments.Give managers and teams proactive, contextual coaching to lead effectively, communicate clearly, and navigate real work situations as they happen.
-
1
Flamingo Project
Workflow Designer, Hive Editor, Pig Editor, File System Browser
Flamingo is a open-source Big Data Platform that combine a Ajax Rich Web Interface + Workflow Engine + Workflow Designer + MapReduce + Hive Editor + Pig Editor. 1. Easy Tool for big data 2. Use comfortable in Hadoop EcoSystem projects 3. Based GPL V3 License Supporting Pig IDE, Hive IDE, HDFS Browser, Scheduler, Hadoop Job Monitoring, Workflow Engine, Workflow Designer, MapReduce. -
2
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. -
3
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... -
4
-
Unrivaled Embedded Payments Solutions | NMINMI Payments is an embedded payments solution that lets SaaS platforms, Software companies and ISVs integrate, brand, and manage payment acceptance directly within their software—without becoming a PayFac or building complex infrastructure. As a full-stack processor, acquirer, and technology partner, NMI handles onboarding, compliance, and risk so you can stay focused on growth. The modular, white-label platform supports omnichannel payments, from online, mobile and in-app to in-store and unattended. Choose from full-code, low-code, or no-code integration paths and launch in weeks, not months. Built-in risk tools, flexible monetization, and customizable branding help you scale faster while keeping full control of your experience. With NMI’s developer-first tools, sandbox testing, and modern APIs, you can embed payments quickly and confidently.
-
5
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
...It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later. -
6
-
7
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 classical implementations -
8
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 -
9
Weka4OC GUI for Overlapping clustering
Weka4OC: Weka for Overlapping Clustering is a GUI extending WEKA
This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups. -
Unimus makes Network Automation and Configuration Management easy.We aim to make automation, disaster recovery, change management and configuration auditing painless and affordable for a network of any size.
-
10
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. ... -
11
ktree
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja. -
12
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...
-
13
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. -
14
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
15
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
16
algebrain
Math Parser for Java
Moved to GitHub https://github.com/fedups Algebraic equation processing at run time for Java programs. Supports variables, functions with parameters, rate table lookups, an embedded "if" function... Infinitely extensible, very small footprint. -
17
Funnel Sort
command line sort utility
Moved to GitHub https://github.com/fedups A command-line utility to sort files. Funnel is a sort utility to sort files, large and small. It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki. -
18
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
19
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
20
Programming Accessory Kit
PAK is a collection of library code to handle the overhead of coding
PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below... -
21
-
22
-
23
-
24
-
25
Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.
