1923 search results - page 213 / 385 » Modeling Complexity in Secure Distributed Computing |
SIGMETRICS
2006
ACM
15 years 4 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
ENC
2004
IEEE
15 years 1 months ago
2004
IEEE
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
FTML
2008
14 years 10 months ago
2008
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
GI
2009
Springer
14 years 7 months ago
2009
Springer
: The evolution and structuring of plant communities is governed by local plant-to-plant interaction. It has been shown that the individual variability of the organisms and the spa...