Search Results for "algorithms" - Page 5

...Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. In Proceedings of the BioNLP 2011 Workshop Companion Volume for Shared Task, Portland, Oregon, June. Association for Computational Linguistic

A java implementation of several evolutionary algorithms as part of the Unified Algorithm Collection developed by Jonatan Gomez

This project implements the "fifteen puzzle", but it has a twist: the program can solve the puzzle perfectly. The project contains a simple JAVA framework that implements heuristic goal-seeking algorithms. We use this to search for the best solution, but the framework is general-purpose and can be used for similar one-person puzzles. Using this framework will allow developers to focus on a specific domain of interest, while leaving many of the AI concepts and goal-searching concepts to be implemented by the framework The front-end classes use Swing and thus can be run via the Web. ...

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

A unified collection of algorithms for Artificial Life. It includes evolutionary algorithms, neural networks, data mining tools, compilers, among others.

EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors.

X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.

Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.

Sleepwalker aims to provide a highly abstract, universal, reusable, extensible Java-based genetic algorithms framework which can be used as a basis for modelling and programming virtually any practical optimisation problem.

An information extraction library implementing modern algorithms for the extraction of named entities from text.

breve is a free, open-source 3D multi-agent simulation package designed for simulating decentralized systems and artificial life.

MAPONTO is an interactive tool for discovering semantic mappings between database schemas and ontologies as well as between different database schemas. The tool analyzes semantics in the input schemas and ontologies for generating semantic mappings.

A library to support spread activation techniques over ontologies.

A java library for the processing and analysis of natural language texts and other sequential data. The focus is on unsupervised modeling with simple, statistical methods as well as implementations of more complex algorithms.

This project aims to test Distributed Artifitial Intelligence in a urban traffic light control. GlobalSyncLocal is used to interact with the SUMO simulator through the TraSMAPI.

Cambrian is a set of optimizing libraries design to optimize multi and mono objective functions. Cambrian is extension of Genetikos application developed to use genetic algorithms.

SwarmTSP is a library of swarm intelligence algorithms for the Traveling Salesman Problem. Currently, it implements Ant Colony Optimization and Consultant-Guided Search algorithms.

The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.

Toroid experiment is a try to create a model of life where animals evolving driving by genetic algorithms and each animal has it's own brain which is a neural network. For detailed description look at project page http://toroid-world.sourceforge.net

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.

A generic library made to represent Puzzles and programs to solve them (Solvers), a specialization for 2d puzzles, specialization for the N-Puzzle, Several solving algorithms for the N-Puzzle. Command line and Graphical User Interface for N-Puzzles.

A system intended for experimenting with computer vision algorithms employing OpenCL.

Open data mining platform. Provides common architecture for algorithms of various types. Efficient processing of arbitrarily large volumes of data thanks to data streaming. Weka and Rseslib partially integrated. (www.debellor.org)

Java Metaheuristics (JMH) is a Java library aimed at the design and implementation of exact and approximated algorithms for optimization problems. JMH is specifically tailored for the design of metaheuristic procedures.