866 search results - page 110 / 174 » On Dynamic Shortest Paths Problems |
133
click to vote
IPSN
2005
Springer
15 years 8 months ago
2005
Springer
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...
114
Voted
PDPTA
2007
15 years 4 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
JEA
2006
15 years 2 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
142
click to vote
ASIAN
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
115
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Multihoming has been used by stub networks for several years as a form of redundancy, improving the availability of Internet access. More recently, Intelligent Route Control (I...