We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...