Search Results for "combinatorial"

Beyond its much publicized success in attaining superhuman level at games such as Chess and Go, DeepMind's AlphaZero algorithm illustrates a more general methodology of combining learning and search to explore large combinatorial spaces effectively. We believe that this methodology can have exciting applications in many different research areas. Because AlphaZero is resource-hungry, successful open-source implementations (such as Leela Zero) are written in low-level languages (such as C++) and optimized for highly distributed computing environments. This makes them hardly accessible for students, researchers and hackers. ...

HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain.

This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007.

Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.

Flexible job shop scheduling problem (FJSP) is very important in many fields such as production management, resource allocation and combinatorial optimization. In the real manufacturing systems, each operation could be processed on more than one machine and each machine can also process several operations. This feature is known as flexibility. You can define your problem in this software and get an optimal solution as a Gantt Chart. This software is based on my M.Sc. thesis of Shahed university (Tehran, Iran).

A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem. The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra Group which does research about Constraint Programming and related technologies: Water Retention on Magic Squares with Constraint-Based Local Search http://urn.kb.se/resolve?...

Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.

Shears is a C# library for list processing, combinatorial problems, and functional programming. It is intended to be useful for everyday coding, with an emphasis on producing brief, readable code. It's also lots of fun!

Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.

GLARE is a library and a software for product based optimization of reagent lists in the context of a chemical combinatorial library design. Large virtual combinatorial libraries containing 10^12 products have been optimized within a second.