272 search results - page 30 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
146
Voted
ISCI
2008
15 years 3 months ago
2008
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
174
Voted
ECML
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
154
Voted
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
123
Voted
APSCC
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
152
Voted
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...