Sciweavers

4719 search results - page 841 / 944
» Newtonian program analysis
Sort
View
CN
2007
137views more  CN 2007»
14 years 11 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
14 years 11 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
IJHPCN
2006
116views more  IJHPCN 2006»
14 years 11 months ago
Implications of application usage characteristics for collective communication offload
Abstract-- The performance of collective communication operations is known to have a significant impact on the scalability of some applications. Indeed, the global, synchronous nat...
Ron Brightwell, Sue Goudy, Arun Rodrigues, Keith D...
CONCURRENCY
2007
101views more  CONCURRENCY 2007»
14 years 11 months ago
OpenUH: an optimizing, portable OpenMP compiler
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. Despite its broad availability, there remains a need ...
Chunhua Liao, Oscar Hernandez, Barbara M. Chapman,...
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 11 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov