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.
DrPangloss is a python implementation of a three operator geneticalgorithm, complete with a java swing GUI for running the GA and visualising performance, generation by generation
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.
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/.
Sales CRM and Pipeline Management Software | Pipedrive
The easy and effective CRM for closing deals
Pipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
The main goal of OWLVE is to visualize graphically any OWL–lite file. Using powerful RCP and GEF technologies will improve the quality of graphics and diagrams.This project includes an algorithm for similarity calculus between two OWL files.
NullAllEst is the implementation of a maximum likelihood algorithm to estimate the frequency of a null allele in microsatellite genetic data. A Markov Chain Monte Carlo simulation is used to solve the likelihood function.
An implementation of the Compositional Pattern Producing Networks (CPPNs) and Neuro-Evolution of Augmenting Topologies (NEAT) proposed by Kenneth O. Stanley, based on the Genetic Art tool from Mattias Fagerlund.
OAP Lite is Optimized Algorithms Platform Lite, which simplifies the process of solving some optimization problems by Genetic Algorithms. It is a highly configurable, efficient tool for user to get the optimum result without programming.
This project intends to create an indexing search engine, for knowledge management. The primary object is to apply an information retrieval core. And implement a knowledge data discovery theory such as data mining algorithm, text mining.
M+ Compiler/Interpreter is a interpreter library written in Java that delivers the possibility to extend any Java application with simple scripts. Besides the usage of native datatypes and operations you can instantiate and call native Java objects.
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.
Markov interpreter is an interpreter for "Markov algorithm". It parses a file containing markov production rules, applies it on a string and gives the output.
Java aplication that helps genetic engeneers to simulate the outcome of experiments (electroforesis, DNA cloning and cleavage), search for specific sites in
DNA sequence, draw DNA maps
with features: protein and regulation genes, restriction sites
Private-key, symmetrical (same password to encrypt and decode) file encryption with 8-bit to 2147483647-bit (2^3 to 2^31) encryption using my own algorithm and my own extension of MD5 (http://blog.robtoth.net/2009/06/tencryption-computer-programming.html
NeuroDraughts is a Draughts/Checkers game that teaches itself how to play through self play. It combines an Artificial Neural Network, trained by Temporal Difference Learning using some GeneticAlgorithm style behaviour.
musicomp is a program which most important element is an evolutionary algorithm which uses data mining methods as a fitness function to generate monophone melodies.
StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms.
An intuitive user interface shows each algorithm step accurately...
QMCMinimizer is a java-swing based aplication. It's designed with the purpose to be used as a tool on university degrees such as computer science, for teaching the process of boolean function simplification, through the Quine-McCluskey algorithm.
The Drools.NET is a .NET port for Drools, which is a java Rules Engine based on Charles Forgy's Rete algorithm. Drools.NET enables .NET developers/Users to exploit the powerful Rule Engine like Drools through a completely managed .NET code base.
This project provides a JAVA library and a graphical user interface which implement the "FastICA" algorithm based on the paper "Fast and Robust Fixed-Point Algorithms for Independent Component Analysis (ICA)" by Aapo Hyvärinen.
This is an attempt to make a X vs. O game, without using a back-tracing, or any other time wasteful algorithm. Instead, an arrays of bonuses are used. Bonuses are given for each move, after which empty fields are sorted.
jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.