848 search results - page 131 / 170 » Randomness and the linear degrees of computability |
122
click to vote
WEA
2010
Springer
15 years 6 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
SLIP
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, a comprehensive and fast method is presented for the timing analysis of process variations on single-walled carbon nanotube (SWCNT) bundles. Unlike previous works t...
115
click to vote
VALUETOOLS
2006
ACM
15 years 5 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
SIGMETRICS
2002
ACM
14 years 11 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
DAC
2006
ACM
16 years 24 days ago
2006
ACM
For statistical timing and power analysis that are very important problems in the sub-100nm technologies, stochastic analysis of power grids that characterizes the voltage fluctua...