findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS). An independent set of a graph is a subset of vertices in which no two vertices are adjacent. Given a set of vertices, the maximum independent set problem calls for finding the independent set of maximum cardinality.
Algorithm run in O(n^2) time, where n is the number of vertices (worst case). Experimentally: time = 8.1e-007*n^2 +...
The algorithm of Karge Thompson is a heuristic algorithm that allows to obtain, given a specific group of jobs to be produced, the best sequence in terms of time setup.
Hypothesis:
N indipendent jobs;
delivery...
ev-MOGA Multiobjective Evolutionary Algorithm has been developed by the Predictive Control and Heuristic optimization Group at Universitat Politdoducnica de Valdoduncia. ev-MOGA is an elitist multi-objective evolutionary algorithm based on the...
Heuristic method for the Traveling Salesman Problem (TSP) A number of nearest neighbour tours are generated from randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is...
Java framework for applying meta-heuristic (multi-objective) optimization algorithms like an Evolutionary Algorithm, Particle Swarm Optimizer, Differential Evolution, or Simulated Annealing to arbitrary optimization problems.(visit:...
A heuristic approach to solving the Knight's Tour Puzzle
An heuristic image stitcher made to test Genetic and PSO based algorithms
Search Agents - a framework for collaboration of meta-heuristic agents
A C++ Template Meta-Heuristic library. This project provides a template meta-programming library for meta-heuristics. The library is policy-based, providing policies to build different meta-heuristics applied to several domains.
Piggydb is a flexible and scalable knowledge building platform that supports a heuristic or bottom-up approach to discover new concepts or ideas based on your input. You can begin with using it as a flexible outliner, diary or notebook, and as...
Plansim is a C++ framework aimed to the development of efficient planner agents based on heuristic forward search, that use discrete event simulators as the model for the agent's environment.
To draw an IFS fractal probabilities of each transformation must be given normally. This code calculates the probabilities using a heuristic instead. The bounding rectangle of the fractal also calculated automatically.
I found this equation in Wikipedia page for "List of fractals by Hausdorff dimension". The problem is how to calculate the scaling coefficients for any given IFS fractal. You can see the heuristic I used in the code. It...
How do you find the shortest path from one point to another in a computationally efficient way? The A* algorithm provides one implementation where the distance to the goal is considered as a heuristic in addition to local weightings, and the best...
Matlab Toolbox for Submodular Function Optimization (v 2.0)
By Andreas Krause (krausea@gmail.com). Slides, videos and detailed references available at http://www.submodularity.org
Tested in MATLAB 7.0.1 (R14), 7.2.0...
This function does the decomposition of a separable nD kernel into its 1D components, such that a convolution with each of these components yields the same result as a convolution with the full nD kernel, at a drastic reduction in...
A simple one-player othello board-game program. Players control the white piece while the computer AI controls the black. The AI uses a simple heuristic-based optimization search. For simplicity, it only searches up to one move ahead.
Unused #includes in C++ source lead to unwanted dependencies and slower compile and link timings.
IncludeChecker finds most of these unused #includes using a simple heuristic: if you include a file, you need to use one or more symbols...
RAR Password Recovery is a powerful tool to recover lost (forgotten) passwords for a RAR/WinRar archives. The program supports the Brute-Force attack, dictionary-based attack and dramatically fastest "Booost-Up" attack. The program is...
Easily develop robust production applications, in VB, C++ or Delphi, to capture barcode data from scanned, faxed or camera images. Heuristic barcode recognition algorithms can extract readable barcodes from poor quality images.Accept and save... |