7006 search results - page 573 / 1402 » Approximation Algorithms |
181
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
161
click to vote
ISPD
2006
ACM
16 years 29 days ago
2006
ACM
APlace is a high quality, scalable analytical placer. This paper describes our recent efforts to improve APlace for speed and scalability. We explore various wirelength and densi...
223
click to vote
NETWORKING
2000
15 years 8 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
192
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
206
click to vote
TSP
2008
15 years 5 months ago
2008
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...