Search Results for "backtracking"

**Burn To The Brim** is a highly efficient archiving utility designed to solve the classic subset-sum (bin packing) optimization challenge. It intelligently selects and groups files and directories (documents, high-fidelity media, or raw back-ups) to optimally fill recordable Blu-Rays, USB drives or custom-capacity storage drives. By recursively scanning your designated folders, BTTB matches item sizes to your media capacity, finding a near-perfect selection in milliseconds and an...

...ToT allows LMs to perform deliberate decision-making by considering multiple different reasoning paths and self-evaluating choices to decide the next course of action, as well as looking ahead or backtracking when necessary to make global choices.

LillyTab is a modular description logic consistency checker (reasoner) with support for a subset of OWL/DL.

...Therefore, with few interfaces implementations you can already run advanced combinatory solutions. Just to name a few algorithms, the Framework can solve any constraints problems using: - Regular Backtracking; - A variety of Backjumping algorithms; - A variety of arc-consistency algorithms; - Local search algorithm; - Tabu search algorithm; - Maximize solutions: comming soon; - Minimize solutions: comming soon; The Framework also enables heuristic injections so that the developers can achieve greater performance of algorithms using their own heuristics. ...

Highly tunable, simple to use collection of the templates, containing a set of classes for solving unconstrained large scale nonlinear optimization problems. Currently it contains: -- Limited Memory Quasi Newton (L-BFSG) -- BFSG -- Conjugate Gradient -- Gradient Descent -- Wolf condition Line Search -- Backtracking Line Search -- Exact Golden Search -- Golden Search with Wolf condition We also distribute a set of tests with the library.

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.