Search Results for "algorithm" - Page 12
Sort By:
Showing 355 open source projects for "algorithm"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
Our Free Plans just got better! | Auth0You 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.
-
1
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
-
2
This project aims to create an application to solve the job shop schedule problem using genetic algorithm on the IBM Cell BE processor. This is useful especially using the power of Cell for the large scale job shop schedule problem.
-
3
PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.
-
4
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.
-
Deliver secure remote access with OpenVPN.OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
-
5
Wodka is the implementation of a genetic algorithm (GA) that can bread two dimensional structures that might be used as robots in sodarace competitions.
-
6
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.
-
7
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
-
8
-
9
The project implements Dana Angluin's learning algorithm with intent to look into the possibility of computational learning of changing (shifting) information.
-
Crowdtesting That Delivers | TesteumTesteum 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.
-
10
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/.
-
11
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
-
12
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.
-
13
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.
-
14
Arlisy stands for artificial life synthesizer. It uses artificial neural networks and an evolutionary algorithm to simulate the process of life.
-
15
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.
-
16
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.
-
17
In imitative learning, an agent will attempt to match what is observed to their memory. By visualizing the incorrectly matches "scenes", this project will allow algorithm developers to gain a better understanding of what causes their algorithms to fail.
-
18
Neural networks evolution (genetic algorithm) written in Java. Now neural networks try to playing Go, Tic-Tac-Toe.
-
19
MultiBoost is a C++ implementation of the multi-class AdaBoost algorithm. AdaBoost is a powerful meta-learning algorithm commonly used in machine learning. The code is well documented and easy to extend, especially for adding new weak learners.
-
20
Zerorule is a lite rule engine/expert system that implements the RETE algorithm which can improve the speed of forward-chained rule system. It is written entirly in the powerful python language. it supplies both a script interpreter and simple CLI.
-
21
NSvm is a .Net Support Vector Machine library written in .Net. NSvm features the SMO algorithm, a few kernels (including ad hoc algorithms for linear kernels). The objectives of NSvm are simplicity, flexibility and extensibility.
-
22
ANJI (Another NEAT Java Implementation) Built on top of existing OpenSource projects, ANJI is an implementation of NEAT (Neuro-Evolution of Augmenting Topologies), an algorithm for evolving artificial neural networks.
-
23
-
24
Artificial vision library. Objectives are to make an OCR, fingerprint and face identification as some applications through a general purpose learning and pattern relationships algorithm (Currently performs very basic identification).
-
25
Yacca is an advanced chat bot (other plugins are under development, including a command-line only version for you to interact with yacca) that is designed to resemble a human chatter as closely as possible.
