Sciweavers

707 search results - page 29 / 142
» Solving path problems on the GPU
Sort
View
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 9 months ago
Stochastic optimization for Markov modulated networks with application to delay constrained wireless scheduling
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...
Michael J. Neely
TNC
2004
112views Education» more  TNC 2004»
15 years 1 months ago
On the Joint Use of new TCP Proposals and IP-QoS on High Bandwidth-RTT Product Paths
A very practical network problem for the effective deployment of a transatlantic computational GRID which is the current under-utilisation of the newly available fat long pipes dr...
Andrea di Donato, Peter Clarke, Frank Saka, Javier...
INFOCOM
2010
IEEE
14 years 10 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
ICC
2007
IEEE
183views Communications» more  ICC 2007»
15 years 6 months ago
Most Reliable Routing in WDM Mesh Networks with Arbitrary Risk Distribution
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
Ji Li, Kwan Lawrence Yeung
AUSAI
2008
Springer
15 years 1 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan