Search Results for "graph isomorphism algorithm"

Vald is a highly scalable distributed fast approximate nearest neighbor dense vector search engine. Vald is designed and implemented based on the Cloud-Native architecture. It uses the fastest ANN Algorithm NGT to search for neighbors. Vald has automatic vector indexing and index backup, and horizontal scaling which is made for searching from billions of feature vector data. Vald is easy to use, feature-rich and highly customizable as you needed. Usually, the graph requires locking during indexing, which causes stop-the-world. But Vald uses distributed index graphs so it continues to work during indexing. ...

Spektral is a Python library for graph deep learning, based on the Keras API and TensorFlow 2. The main goal of this project is to provide a simple but flexible framework for creating graph neural networks (GNNs). You can use Spektral for classifying the users of a social network, predicting molecular properties, generating new graphs with GANs, clustering nodes, predicting links, and any other task where data is described by graphs. Spektral implements some of the most popular layers for...

...It contains a player (Pregor) controlled by the user and an NPC (Dorban) controlled by the Svarog interpreter. The objective is to kill the vampire. Or at least to attack him with the optimal chances. The Svarog AI library contains a new optimization algorithm based on so called hidden variables. In order to achieve the objective Dorban will try to convince Pregor to accompany him, and together they will try to find the vampire in a graph with 5 city nodes. When accompanying Dorban use menu item "follow orders" to follow his orders.

Graph level memory allocation optimization and buffer reuse are supported. The core library tries to keep minimum external dependencies to keep the library footprint small.

...Our platform Easy Machine Learning presents a general-purpose dataflow-based system for easing the process of applying machine learning algorithms to real-world tasks. In the system, a learning task is formulated as a directed acyclic graph (DAG) in which each node represents an operation (e.g. a machine learning algorithm), and each edge represents the flow of the data from one node to its descendants.

...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 network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today.

This project aims to develop and share fast frequent subgraph mining and graph learning algorithms. Currently we release the frequent subgraph mining package FFSM and later we will include new functions for graph regression and classification package

The MaxParser is written in c++ and can parse with first, second, third and fourth order projective Graph-based Dependency parsing algorithm. The project is the new version of the project "Max-MSTParser". If you want to use this software for research, please reference this web address in your papers

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.

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.