2157 search results - page 206 / 432 » Binary ant algorithm |
150
Voted
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
180
Voted
ISCI
2008
15 years 6 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...
213
click to vote
EC
1998
15 years 6 months ago
1998
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
185
click to vote
PPL
2010
15 years 1 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
177
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...