5580 search results - page 108 / 1116 » Randomized priority algorithms |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
CEC
2007
IEEE
14 years 11 months ago
2007
IEEE
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
ICOIN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...