Sciweavers

3147 search results - page 444 / 630
» Distributed averaging in dynamic networks
Sort
View
IPPS
2006
IEEE
16 years 18 days ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang
IPPS
1999
IEEE
15 years 11 months ago
Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel Programs
Adaptive parallel computations--computations that can adapt to changes in resource availability and requirement--can effectively use networked machines because they dynamically ex...
Arash Baratloo, Ayal Itzkovitz, Zvi M. Kedem, Yuan...
ICCD
2004
IEEE
128views Hardware» more  ICCD 2004»
16 years 3 months ago
Static Transition Probability Analysis Under Uncertainty
Deterministic gate delay models have been widely used to find the transition probabilities at the nodes of a circuit for calculating the power dissipation. However, with progress...
Siddharth Garg, Siddharth Tata, Ravishankar Arunac...
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 7 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ICC
2008
IEEE
143views Communications» more  ICC 2008»
16 years 1 months ago
A Closed-Form Expression for Static Worm-Scanning Strategies
—This work presents a closed-form expression for characterizing the spread of static worm-scanning strategies through a mean-field approximation. Our model can both accurately c...
Zesheng Chen, Chao Chen