866 search results - page 50 / 174 » On Dynamic Shortest Paths Problems |
148
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
143
click to vote
BIOWIRE
2007
Springer
16 years 4 days ago
2007
Springer
This paper presents a biologically inspired routing protocol called Self Selective Routing with preferred path selection (SSR(v3)). Its operation resembles the behavior of a biolog...
154
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
180
click to vote
IWDC
2005
Springer
15 years 11 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...