Search Results for "console command" - Page 2

PExtractor es un proyecto orientado a la informática forense, capaz de detectar ficheros ejecutables (PE) que se encuentran en el interior de otro ejecutable, creado por herramientas tipo "Joiner/Binder", para extraerlos y facilitar su posterior anál

Bayesian Surprise Matlab toolkit is a basic toolkit for computing Bayesian surprise values given a large set of input samples. It is also useful as way of exploring surprise theory. For more information see also: http://ilab.usc.edu/

Using this plugin-based framework, you can instantly start working on the *brain* of your bot (irc bot, chatterbot, robot, ...). With support for db, irc, logging and programming-language independent plugins, users can easily enhance the functionality.

Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.

JVnSegmenter is a Java-based and open-source Vietnamese word segmentation tool. The segmentation model was trained on about 8,000 sentences using Conditional Random Fields (FlexCRFs). This tool would be useful for Vietnamese NLP community.

command line image/2D dataset analysis environment

Mcube is designed to solve 4x4x4 Rubiks Cubes (AKA, Rubiks Revenge, AKA, Master Cube). It is multiplatform, and has both console and graphical support.

VKAS uses genetic programming methods to find out the relationship among a set of independent and dependent variable. It is a problem solver software which uses evolutionary computing methods. When vkas is run, it creates a population of chromosomes at random. This population is then genetically modified and next population is generated. 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...

NeoBio is a Java class library of Computational Biology Algorithms. The current version consists mainly of pairwise sequence alignment algorithms such as the classical dynamic programming methods of Needleman-Wunsch and Smith-Waterman.