We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clus...
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
Abstract. In this work we propose a different particle swarm optimization (PSO) algorithm that employs two key features of the conjugate gradient (CG) method. Namely, adaptive wei...
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
MiniBit, our automated approach for optimizing bit-widths of fixed-point designs is based on static analysis via affine arithmetic. We describe methods to minimize both the intege...
Dong-U Lee, Altaf Abdul Gaffar, Oskar Mencer, Wayn...