1857 search results - page 69 / 372 » Minimum Degree Orderings |
100
click to vote
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
139
click to vote
ICFP
1997
ACM
15 years 4 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
178
click to vote
APAL
2011
14 years 7 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
117
click to vote
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
COMBINATORICS
2006
14 years 12 months ago
2006
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...