4075 search results - page 766 / 815 » Modeling Distributed Algorithm Using B |
81
Voted
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
125
click to vote
EDBT
2008
ACM
16 years 21 days ago
2008
ACM
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffici...
113
Voted
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a trad...
HICSS
2009
IEEE
15 years 7 months ago
2009
IEEE
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
108
click to vote
ARC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...