This paper discusses the selection and design of heuristic procedures for solving one-dimensional roll trim problems. These are well-defined combinatorial problems which are too large to optimize.
Here is a sneak peek at the AI content in EDA and how it comprises four camps, all missing the real opportunity.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results