Search Results for "max"

UnBBayes is a probabilistic network framework written in Java. It has both a GUI and an API with inference, sampling, learning and evaluation. It supports Bayesian networks, influence diagrams, MSBN, OOBN, HBN, MEBN/PR-OWL, PRM, structure, parameter and incremental learning. Please, visit our wiki (https://sourceforge.net/p/unbbayes/wiki/Home/) for more information. Check out the license section (https://sourceforge.net/p/unbbayes/wiki/License/) for our licensing policy.

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

Traditional Malaysian board game. Similar to Mancala. Implement NeuralNetwork (NN) agent, Min-Max, and Random move. System is based on Adam Cofer's Mancala system (2003). Also using Neuroph 2.5b by Zoran Servarac for NN. All code under GPLv3.

Conversion between different grammar frameworks is of great importance to comparative performance analysis of the parsers developed on them. This tool can convert CCG derivations to PTB trees by using Max Entropy models as well as visualizing the tree graphs. The main technical innovation presented here is the effective conversion method which achieves a F score over 95%.

SwarmQAP is a Java library of swarm intelligence algorithms for the Quadratic Assignment Problem. Currently, it implements Tabu Search, MAX-MIN Ant System and Consultant-Guided Search algorithms.

Highly reusable and extensible Decision-Tree (Max-Gain) framework comprising of comprehensive input-processing and display functionality. Handles nominal, linear, continuous data. For preliminary description, refer - http://sushain.com/blog/archives/

...Each population is subjected to fitness calculation and if a suitable answer chromosome is found then vkas stops and the answer is printed. If a suitable answer is not found then the program stops after specified max generations are over.

Play Gomoku against computer player. The computer player is implemented using a min/max tree with alpha-beta pruning.