8 search results - page 1 / 2 » Stochastic Shortest Paths Via Quasi-convex Maximization |
ESA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
CDC
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
WSC
2008
13 years 7 months ago
2008
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
TWC
2008
13 years 4 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...