Sciweavers

2038 search results - page 28 / 408
» Loops under Strategies
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Throughput Anonymity Trade-off in Wireless Networks under Latency Constraints
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...
Parvathinathan Venkitasubramaniam, Lang Tong
ILP
2005
Springer
14 years 1 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
EUROPAR
2006
Springer
13 years 11 months ago
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...
Alban Douillet, Hongbo Rong, Guang R. Gao
TIFS
2008
149views more  TIFS 2008»
13 years 7 months ago
Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach
In autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
Wei Yu, K. J. Ray Liu
IPPS
1999
IEEE
13 years 11 months ago
Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory Machines
Automatic Global Data Partitioning for Distributed Memory Machines DMMs is a di cult problem. In this work, we present a partitioning strategy called 'Hyperplane Partitioning...
S. R. Prakash, Y. N. Srikant