AI-powered service management for IT and enterprise teams
Enterprise-grade ITSM, for every business
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
Try it Free
Our Free Plans just got better! | Auth0
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
Offers Random numbers API for your programs written in Java.
Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service.
Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota.
It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all...
An API for Java developers who need Genetic Algorithms
This API is intended to help developers use genetic algorithms in their own java applications. GeneticLibrary.zip contains the netbeans project of the API itself. GeneticTrial.zip contains another netbeans project which is an example explaining how to use the API. docs.zip is the documentation of the API. Please take a look there, it is really helpful. I have only two request from who will use this API;
USE, UPDATE AND MODIFY IT FREELY
JUST NOTE THE ORIGINAL AUTHOR
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
Unfixed bugs delaying your launch? Test with real users globally – check it out for free, results in days.
Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights. Click to perfect your product now.
JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.
Zero Sum Game Solver JavaLibrary is open source javalibrary to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.
Fastest string utility is javalibrary (JAR ) for string operation . This library is very easy to use, very fast and very efficient in string operations such as split, toUpperCase, toLowerCase, replace, delete, regular expression and others.
A high-performance functional, set-theoretic collections library. All collections are immutable; updates return a new collection. Supports arbitrary nesting (sets of sets etc.). Implemented with heterogeneous binary trees. Lisp and Java; more to come.
Framework for development of simple evolutionary algorithms / island models programs in distributed environment using MapReduce programming model based on hadoop.
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving 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.
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.
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.
swIMP (swig-based Interfaces for Mathematical Programming) provides Java wrappers for solvers written in C or C++. The current focus is on accessing OSI-compatible linear programming (LP) solvers from the Coin-OR-project (e.g. Clp, GLPK, MOSEK, CPLEX).
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
Data types and utility classes for use with evolutionary algorithms.
EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors.
Awakener aims to provide a Javalibrary for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.
A java project to create a library that can calculate decompression schemes for diving. Different open source algorithms can be chosen to use for the calculation. For example Bühlmann and VPM.
JavaStates is a Javalibrary designed to statically describe and animate the states of Java objects, while ensuring that the integrity of states is retained at all times. JavaStates brings OO Programming style to interface spec, design and coding.
A Javalibrary and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs.
The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
pack:tag is now available at github: https://github.com/galan/packtag
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.