Search Results for "graph class"

Amine is an Artificial Intelligence Multi-Layer Java Open Source Platform dedicated to the development of various kinds of Intelligent Systems and Agents (Knowledge-Based, Ontology-Based, Conceptual Graph -CG- Based, NLP, Reasoning and Learning, Natural Language Processing, etc.). Ontology, KB can be created and manipulated with various processes. CG theory is used as the main knowledge representation language. Amine provides two languages: PROLOG+CG which extends PROLOG with CG and Amine...

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

Prolog+CG is a Java implementation of Prolog with extensions implementing a subset of the Conceptual Graph (CG) theory of John Sowa. CGs are first-class datatypes on a par with terms. Object oriented extensions are also included.

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...

The Cogitant library is a set of C++ classes enabling to easily build applications based on the Conceptual Graph model.

The project has moved to github https://github.com/EnFlexIT/AgentWorkbench Agent.GUI is a simulation framework and toolkit based on the JADE framework. It provides functionalities for time aspects, agent-environment interaction, visualization and load balancing, Furthermore, the included application focuses the usability for end users.

This project develops a simple, fast and easy to use Python graph library using NumPy, Scipy and PySparse.

NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.

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.

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.

The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.

JUNG provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. New version now available on GitHub: https://github.com/jrtom/jung/releases/tag/jung-2.1

An adaptive mini database learns algorithmic operations for data intensive algebraic computational methods within a pervasive computing graph. It also provides generic structures and algorithms as a data fabric.

mRDP (Multicast Resource Discovery Protocol) API is a Java API that enables RDF resource discovery via SPARQL queries over UDP multicast messages. The mRDP API uses the Jena API for managing the RDF graph and SPARQL queries execution.

GraphSpider is a pattern matcher which searches parsed text in phrase-structure tree or dependency graph format for syntactic structures matching a set of patterns in MPL, a regexp-like pattern language. Applications: information extraction, text mining.