162 search results - page 18 / 33 » Minimizing Average Finish Time in P2P Networks |
CISS
2007
IEEE
14 years 4 months ago
2007
IEEE
AbstractWe consider a wireless network consisting of multiple sources communicating with their corresponding destinations utilizing a single half-duplex relay. The goal is to min...
WSC
2008
14 years 3 days ago
2008
A dynamic simulation-based crashing method is introduced in this research to evaluate project networks and determine the optimum crashing configuration that minimizes the average ...
SRDS
2003
IEEE
14 years 3 months ago
2003
IEEE
Many mathematical models have been proposed to evaluate the execution performance of an application with and without checkpointing in the presence of failures. They assume that th...
ESA
2000
Springer
14 years 1 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
TON
2010
13 years 4 months ago
2010
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...