343 search results - page 10 / 69 » Estimating routing congestion using probabilistic analysis |
ASPDAC
2005
ACM
14 years 28 days ago
2005
ACM
To handle modern routing with nanometer effects, we need to consider designs of variable wire widths and spacings, for which gridless routers are desirable due to their great fle...
VTS
2006
IEEE
14 years 1 months ago
2006
IEEE
Monte Carlo analysis has so far been the corner stone for analog statistical simulations. Fast and accurate simulations are necessary for stringent time-to-market, design for manu...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
AUTOMATICA
2002
13 years 7 months ago
2002
Probabilistic robustness analysis and synthesis for nonlinear systems with uncertain parameters are presented. Monte Carlo simulation is used to estimate the likelihood of system ...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...