Certain classes of problems amenable to description using Problem Frames, in particular ones intended to be implemented using a distributed architecture, can benefit by the additi...
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n−3 edges and exactly k = 2n− m degrees of freedom. The slider-pinning problem is to eliminate all ...