562 search results - page 104 / 113 » How to Optimize Residual Communications |
SIGCOMM
2005
ACM
14 years 28 days ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
SAB
2004
Springer
14 years 21 days ago
2004
Springer
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...