A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This pape...
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
Inspired with Version Space learning, the Iterated Version Space Algorithm (IVSA) has been designed and implemented to learn disjunctive concepts. IVSA dynamically partitions its s...
Abstract-- Local convergence is a limitation of many optimization approaches for multimodal functions. For hybrid model learning, this can mean a compromise in accuracy. We develop...