2899 search results - page 299 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
194
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
188
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
162
click to vote
VTC
2006
IEEE
16 years 19 days ago
2006
IEEE
— We design and implement a local session1 admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for diff...
166
click to vote
GD
2005
Springer
16 years 5 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
200
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...