2038 search results - page 28 / 408 » Loops under Strategies |
137
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—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...
141
click to vote
ILP
2005
Springer
15 years 9 months ago
2005
Springer
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...
137
click to vote
EUROPAR
2006
Springer
15 years 7 months ago
2006
Springer
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...
143
Voted
TIFS
2008
15 years 3 months ago
2008
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...
131
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
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...