We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
Shawn Martin, W. Michael Brown, Jean-Loup Faulon, ...
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
Xiaoji Ye, Min Zhao, Rajendran Panda, Peng Li, Jia...
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...