641 search results - page 93 / 129 » Improved Bounds for Wireless Localization |
ISPDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
PIMRC
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...