72 search results - page 1 / 15 » Practical approximation algorithms for zero- and bounded-ske... |
DAC
1997
ACM
13 years 8 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
FOCM
2007
13 years 4 months ago
2007
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...
ISPEC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
ALGORITHMICA
2011
12 years 11 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...