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.
The implementation of Bee Hive @ Work algorithm that simulates the foraging behavior of honey bees in nature. The aim is to provide an extensible framework that can be used by researchers to simply create new applications of this algorithm.
Java package to study a clustering model described in the paper \"Novel Clustering Algorithm Based Upon Games on Evolving Network\" by Q. Li, Z. Chen, Y. He and J-P. Jiang (in arxiv: http://arxiv.org/pdf/0812.5064v1), generalizations and similar issues.
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.
Java API for implementing any kind of Genetic Algorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
ECSKernel is a multiagent coordination algorithm testbed, built on the RoboCupRescue disaster simulation platform. It is easily configurable and can be used with user-generated scenarios.
Distributed Ant Robotics is divided into two parts. First is the simulation of “ant colony”. Second part is the algorithm application. Where you can use algorithms for ant behavior.
TBLTools is a set of GATE processing resources that implements the Fast Transformation Based Learning Algorithm. You can train it to learn rules for NLP tasks such as Named Entity Recognition and Shallow parsing.
A set of Java libraries for translating textual numbers (including cardinals, ordinals, etc.) between various language systems (e.g. Arabic, Indic, Chinese). Primary users will be developers of machine translation systems and curious desktop users.
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.
TACS (Trust Ant Colony System) is a Trust model for P2P, Ad-hoc and Wireless Sensor networks (also valid for multi-agent systems) based on the bio-inspired algorithm ACS (Ant Colony System).
The Decision Tree Learning algorithm ID3 extended with pre-pruning for WEKA, the free open-source Java API for Machine Learning. It achieves better accuracy than WEKA's ID3, which lacks pre-pruning.Info: http://bruno-wp.blogspot.com/search/label/Softwar
A discretization algorithm based on the Minimum Description Length. Implemented as a filter according to the standards and interfaces of WEKA, the Java API for Machine Learning. More Info: http://bruno-wp.blogspot.com/search/label/Software
Proposed is an algorithm
that uses computer vision, combined with a modified Rubine classifier, to allow
arbitrary N-sided polygons as accepted sketches in real-time.
Random Forest classification implementation in Java based on Breiman's algorithm (2001). It assumes the data is in the form [ X_1, X_2, . . ., X_M, Y ] where Y \in {0, 1, . . ., C}. The user must define M, C, and m initially.
Wodka is the implementation of a genetic algorithm (GA) that can bread two dimensional structures that might be used as robots in sodarace competitions.
RL HNFP is a neuro Fuzzy model which can automatic generate set of rule. So it can implement in domain although human don't have knowledge on it. This project implement that algorithm in Java so other people can use that for their application
The project implements Dana Angluin's learning algorithm with intent to look into the possibility of computational learning of changing (shifting) information.
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/.
DrPangloss is a python implementation of a three operator genetic algorithm, complete with a java swing GUI for running the GA and visualising performance, generation by generation
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.
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.
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.
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.