Search Results for "algorithm" - Page 3

See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/)

This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.

Dinapter automatically generates a mapping between methods of incompatible components/services based on their public interfaces and behaviors. It uses a combination of expert system and A* algorithm. Dinapter is the prototype resulting from a couple of research papers: * J.A. Martín, E. Pimentel. Automatic Generation of Adaptation Contracts, FOCLASA'08, ENTCS, 2008 - http://goo.gl/21iJZ * J.A. martín, E. Pimentel. Dinapter: Automatic Adapter Specification for Software Composition, PROLE'08, ENTCS, 2008 - http://goo.gl/VrQvG ...and later integrated and improved within the ITACA toolbox (http://itaca.gisum.uma.es/): * J. ...

CRF is a Java implementation of Conditional Random Fields, an algorithm for learning from labeled sequences of examples. It also includes an implementation of Maximum Entropy learning.

CRFSharp(aka CRF#) is a .NET(C#) implementation of Conditional Random Fields, an machine learning algorithm for learning from labeled sequences of examples. It is widely used in Natural Language Process (NLP) tasks, for example: word breaker, postagging, named entity recognized, query chunking and so on. CRF#'s mainly algorithm is the same as CRF++ written by Taku Kudo. It encodes model parameters by L-BFGS. Moreover, it has many significant improvement than CRF++, such as totally parallel encoding, optimizing memory usage and so on. ...

A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be...

...The repository covers a broad set of topics such as linear regression, logistic regression, neural networks, clustering, support vector machines, and recommender systems. Each folder corresponds to a specific algorithm or concept, making it easy for learners to navigate and practice. The exercises serve as practical, hands-on reinforcement of theoretical concepts taught in the course. This collection is valuable for students and practitioners who want to strengthen their skills in machine learning through coding exercises.

Though the name suggests something different, MAReN IS an implementation of the Rete algorithm. Is aims to be a rule engine written in plain C, wich comes with a C++ wrapper for developers convenience.

Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and.

Algorithm::Evolutionary provides classes for performing simple evolutionary computation tasks, including definition of objects from XML and SOAP support. It should be interoperable with other EC libraries using SOAP.

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

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 java implementation of several evolutionary algorithms as part of the Unified Algorithm Collection developed by Jonatan Gomez

1.) Investigation with cosine transform, and anti transform algorithm, with some voice recognition code. 2.) Translator: Croatian, English. 3.) 2D to 3D picture algorithm (principle) and new 2Dto3D video conversion code with AviSynth video scripting

This is a variant of k-means algorithm which allows datas to belong to several clusters instead of just one.

PyAline is a python implementation of Grzegorz Kondrak's ALINE phonetic alighment algorithm.

This project is a complete cross-platform (Windows, Linux) framework for Evolutionary Computation in pure python. See the project site at http://pyevolve.sourceforge.net or the blog at http://pyevolve.sourceforge.net/wordpress

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.

Mainly include the codes of genetic algorithm, interative genetic algorithm, that are written in Java Applcations also included such as function optimization, simple fashion design optimization, face optimization and so on

Based on the introduction of Genetic Algorithms in the excellent book "Collective Intelligence" I have put together some python classes to extend the original concepts.

The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.

Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.

BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.

superseded by SgpDec http://sgpdec.sf.net Java implementation of the holonomy algorithm for the algebraic hierarchical decomposition of finite state automata.

Optex Analyzer is a software to analyze and compare algorithms to solve approximately optimization problems. It has a GUI that allows select a set of input files containing raw algorithm results. The analysis is shown with tables and charts.