Sciweavers

866 search results - page 62 / 174
» On Dynamic Shortest Paths Problems
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
A Dynamic Programming Approach for Routing in Wireless Mesh Networks
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
Jorge Crichigno, Joud Khoury, Min-You Wu, Wei Shu
WIOPT
2006
IEEE
14 years 1 months ago
A structural property of solutions to path optimization problems in random access networks
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
Arzad Alam Kherani, Dinesh Kumar 0002, Eitan Altma...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 2 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
AUTOMATICA
2006
99views more  AUTOMATICA 2006»
13 years 7 months ago
Path-following for linear systems with unstable zero dynamics
: A path-following problem for linear systems with unstable zero dynamics is solved. While the original control variable steers the system output along the path, the path parameter...
Dragan B. Dacic, Petar V. Kokotovic
IPL
2010
65views more  IPL 2010»
13 years 6 months ago
Multicasting in the hypercube, chord and binomial graphs
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
Christopher C. Cipriano, Teofilo F. Gonzalez