1559 search results - page 16 / 312 » Heuristic Approaches to Energy-Efficient Network Design Prob... |
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
IJMC
2006
14 years 10 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
EOR
2006
14 years 10 months ago
2006
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
80
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
117
click to vote
WAIM
2007
Springer
15 years 4 months ago
2007
Springer
The rapid progress of wireless communication and embedded micro sensing technologies has made wireless sensor networks possible. Target tracking is an important application of wire...