145 search results - page 23 / 29 » On finding approximate optimal paths in weighted regions |
JSAC
2006
13 years 7 months ago
2006
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
CAAN
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...