242 search results - page 43 / 49 » Distributed algorithms with dynamical random transitions |
157
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
89
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully e...
94
Voted
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
109
click to vote
IJHPCA
2008
14 years 9 months ago
2008
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...