3192 search results - page 269 / 639 » The minimum latency problem |
156
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
148
click to vote
TON
2002
15 years 5 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
156
click to vote
VTC
2006
IEEE
16 years 8 days ago
2006
IEEE
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
195
click to vote
TPDS
2008
15 years 6 months ago
2008
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...
150
click to vote
MSWIM
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we address a fundamental problem concerning the best flooding strategy to minimize cost and latency for target discovery in wireless networks. Should we flood the ...