Search Results for "backtracking" - Page 2

The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. ...

The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.

JSudoku is a Java version of the game Sudoku. A backtracking algorithm cares for random puzzles and based on the Sudoku-Puzzle JavaScript. Optionally, JSudoku generates X-Sudoku puzzles.

Open-source C++ Sudoku Game based on a 2-pass Backtracking algorithm. This has been done as a programming project in the 1st year of engineering course IMIAE. Authors: KHALDI Meryem & MOUSTAKIM Lamiyaa. Supervisors: Professors A. TAIK & D. MOUMIDA

A backtracking (non-packrat) parser generator for parsing expression grammars. The parsers are generated at run-time using the LLVM JIT compilation engine.

During a course at University "La Sapienza" in Rome I developed a fully working SAT solver based on unit propagation and backtracking; it can read DIMACS files and process cnf formulas of any length(there are no restrictions on the number of literals).

The horn++ library allows you to solve logical expressions in C++. The expressions must be transformed to horn clauses, which can be written as C++ expressions. The solver uses backtracking to find a solution for the logical problem.

Sudoku puzzle generator that generates Sudoku puzzles with a given level of difficulty. The puzzles generated have a unique solution and can be solved without backtracking or guessing. The software is written in c++ using stl for windows platform.

CrossBOT is an open source crossword construction system that features an advanced "stand alone" crossword compiler, based on consistency and intelligent backtracking algorithms, along with a web interface.

The backtracking extension to the EPANET hydraulic modeling toolkit

This project pretends solved Distributed Constraint Satisfaction Problems (Dis-CSP) using Mozart-OZ. Asynchronous Backtracking algorithm will be implemented.

...Using the DPLL algorithm and reading file in DIMACS format (cnf boolean expression). Tiger Solver use most features of many important sat-solver: - Double watches list - Chronological Backtracking ....