549 search results - page 44 / 110 » Computing All the Best Swap Edges Distributively |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
AINTEC
2005
Springer
15 years 3 months ago
2005
Springer
— We present a vision of an Intelligent Network in which users dynamically indicate their requests for services, and formulate needs in terms of Quality of Service (QoS) and pric...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
To mitigate inter-cell interference (ICI) and achieve higher spectrum efficiency, fractional frequency reuse (FFR) has been widely adopted by the next generation wireless systems...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...