584 search results - page 25 / 117 » Combinatorial optimization problems in wireless switch desig... |
ICDCS
2007
IEEE
13 years 11 months ago
2007
IEEE
As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide vario...
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
EUROCAST
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
IPCO
2008
13 years 9 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
SECON
2008
IEEE
14 years 2 months ago
2008
IEEE
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...