2340 search results - page 205 / 468 » Copying and Comparing: Problems and Solutions |
172
click to vote
INFOCOM
2006
IEEE
16 years 15 days ago
2006
IEEE
— The capacity problem in wireless mesh networks can be alleviated by equipping the mesh routers with multiple radios tuned to non-overlapping channels. However, channel assignme...
159
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
148
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Orthogonal frequency division multiplexing (OFDM) is the key component of many emerging broadband wireless access standards. The resource allocation in OFDM uplink, however, is...
148
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
173
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...