1923 search results - page 162 / 385 » Modeling Complexity in Secure Distributed Computing |
112
click to vote
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Abstract. In this paper we discuss new adaptive proposal strategies for sequential Monte Carlo algorithms--also known as particle filters--relying on new criteria evaluating the qu...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
The fact that graphics processors (GPUs) are today’s most powerful computational hardware for the dollar has motivated researchers to utilize the ubiquitous and powerful GPUs fo...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
RTS
2006
14 years 10 months ago
2006
Many of today's complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this dem...
HICSS
2006
IEEE
15 years 4 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...