Search Results for "tasks"

The Mathematics Dataset, developed by Google DeepMind, is a synthetic dataset designed to evaluate and train machine learning models on mathematical reasoning and symbolic manipulation. It generates question-and-answer pairs across a wide range of mathematical topics typically found in school-level curricula, testing a model’s ability to reason about algebra, arithmetic, calculus, probability, and more. Each question is programmatically generated with structured templates to ensure clear...

A cross-platform application for exploring Conway's Game of Life and many other types of cellular automata.

Portable software related to Mersenne numbers. Useful to automate certain tasks related to GIMPS (www.mersenne.org) for computers that cannot run the GIMPS software for whatever reason. Much of the code has been in use since 1990 or so by a few people. The project web site at https://mers.sourceforge.io/mersenne.html has data about Mersenne numbers from many people generated by this and other software, notably from the GIMPS project.

TXM is a free and open-source cross-platform Unicode & XML based text analysis environment and graphical client, supporting Windows, Linux and Mac OS X. It can also be used online as a J2EE standard compliant web portal (GWT based) with access control built in. DOWNLOAD LATEST VERSION OF TXM : http://textometrie.ens-lyon.fr/spip.php?rubrique61&lang=en TXM offers a comprehensive range of analysis tools (concordances, collocate search, frequency lists, etc.) based on the powerfull CQP...

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later.

Java Micro Benchmark - control tasks required to determine the comparative performance characteristics of the computer system on different platforms. Can be used to determine the effect of different software on the performance of a computer system.

SIVP stands for Scilab Image and Video Processing toolbox. SIVP intends to do image processing and video processing tasks. SIVP is meant to be a useful, efficient, and free image and video processing toolbox for Scilab.

Maximum entropy is a powerful method for constructing statistical models of classification tasks, such as part of speech tagging in Natural Language Processing. Several example applications using maxent can be found in the OpenNLP Tools Library.

Pocket CRF is a modified version of CRF++, it maintains the simplicity of CRF++ and is able to use high order features. Pocket M3N is a simple Max Margin Markov Networks package for sequence labeling tasks.

CRF++ is a simple, customizable, and open source implementation of Conditional Random Fields (CRFs) for segmenting/labeling sequential data. CRF++ is designed for generic purpose and will be applied to a variety of NLP tasks.

A solution of the Traveling Salesman Problem using the Simulated annealing.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

JStatCom is a software framework that facilitates the creation of JAVA programs for data based analysis tasks in various domains. It provides ways to call routines from specialized software packages, like Matlab, Gauss, Ox, and possibly others.

E-Learn system, mostly intended for subjects with mathematical base (which supports algorythm). Supports: solving math tasks, theory pages, tests, courses.

The Function Wizard is designed to provide a lightweight, fast, and easy to use application that will integrate, differentiate, calculate maxima and minima, etc. basic polynomials, as well as assist in other tedious polynomial tasks.