— The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large numb...
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
This paper presents a method for the detection of multiple concentric circles which is based on the Hough Transform (HT). In order to reduce time and memory space the concentric ci...