4171 search results - page 754 / 835 » Choice numbers of graphs |
173
click to vote
POPL
1996
ACM
15 years 10 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
175
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper we present a power dissipation model considering the charging/discharging of capacitance at the gate output node as well as internal nodes, and capacitance feedthrou...
164
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
221
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
155
click to vote
ESA
1994
Springer
15 years 10 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...