338 search results - page 18 / 68 » Fast distributed random walks |
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
123
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
TRIDENTCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Network modelling and traffic characterisation are essential research activities towards the optimisation of UMTS. We present here our IPv6 Linux-based UTRAN testbed which aim...
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...