178 search results - page 12 / 36 » Computing Longest Previous Factor in linear time and applica... |
CSB
2005
IEEE
14 years 2 months ago
2005
IEEE
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 ...
DAM
2006
13 years 8 months ago
2006
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...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
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 ...
ISQED
2008
IEEE
14 years 2 months ago
2008
IEEE
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...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
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 ...