Sciweavers

1058 search results - page 174 / 212
» Performance Analysis of Mapping Strategies for Parallel Simu...
Sort
View
HPDC
2000
IEEE
15 years 10 months ago
Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness
While the MPP is still the most common architecture in supercomputer centers today, a simpler and cheaper machine configuration is growing increasingly common. This alternative s...
Bianca Schroeder, Mor Harchol-Balter
ARCS
2004
Springer
15 years 11 months ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang
ESORICS
2007
Springer
15 years 10 months ago
Countering Statistical Disclosure with Receiver-Bound Cover Traffic
Anonymous communications provides an important privacy service by keeping passive eavesdroppers from linking communicating parties. However, using long-term statistical analysis of...
Nayantara Mallesh, Matthew Wright
IJCAI
1989
15 years 7 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
JCSS
2008
159views more  JCSS 2008»
15 years 6 months ago
Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models
Internet worms are classically described using SIR models and simulations, to capture the massive dynamics of the system. Here we are able to generate a differential equation-base...
Jeremy T. Bradley, Stephen T. Gilmore, Jane Hillst...