... The two predominant problems with existing web clustering are inconsistencies in cluster content and inconsistencies in cluster description [1]. The first problem refers to the content of a cluster that does not always ...

15

... of **algorithms**, called cellular **memetic** **algorithms** (cMAs), which will be evaluated here on the satisfiability problem ...evolutionary **algorithms**, **memetic** algo- rithms, SAT ...

7

... Abstract. In this work, we study the behavior of several cellular **memetic** **algorithms** (cMAs) when solving the satisfiability problem (SAT). The proposed cMAs are the result of including hybridization ...

12

... these **algorithms**: evolutive computing and swarm ...and **Memetic** **Algorithms** (MAs) highlight between them for synergically combining the global search dynamics of a population metaheuristic with the ...

8

... a **memetic** algorithm is proposed to solve the project scheduling problem described in ...This **memetic** algorithm incorporates diversity-adaptive components into the framework of an evolutionary ...This ...

11

... including **memetic** approaches. A **memetic** approach consists in the interaction of two main techniques, global and local search [9] to improve the efficiency and reduce the limitations in the search logic, ...

139

... In this paper a functional framework for formal **memetic** **algorithms** 23] is intro- duced. It can be easily extended, by subclassication of the class hierarchy, to provide genetic algorithm specialization ...

12

... cache **algorithms** (in particular FIFO, LRU and PLRU) that gives an upper bound on the number of possible observations any of the three attackers can obtain from a specific ...cryptographic **algorithms**, ...

118

... In any case, other well-known metaheuristics could have been used to em- bed CP and LR, such as Tabu Search (TS) or Genetic **Algorithms** (GA). Both metaheuristics have been widely used for tackling different VRP ...

172

... Given a channel, a family of block codes that achieve arbitrarily small probability of error at any communication rate up to the capacity of the channel are called ‘very good’ codes for [r] ...

640

... Genetic **algorithms** (GA’s) are a type of evolutive **algorithms** used to resolve search and optimization problems [5, 6]. They are based on simulating the evolutive process produced in nature to resolve ...

9

... randomized **algorithms** to enforce a probability distribution on the inputs—thereby ensuring that no particular input always causes poor perfor- mance—or even to bound the error rate of **algorithms** that are ...

1313

... KK-means **algorithms** have been run on test problems, analyzing the value of the concordance coef ﬁ cient κ versus the parameter s ¼ 1 ; …; ...KK-means **algorithms** is achieved by small values of s showing that ...

15

... Genetic **algorithms** (GAs) are adaptive methods which may be used to solve search and optimisation ...genetic **algorithms** are able to "evolve" solutions to real world problems, if they have been ...

13

... popular **algorithms** evaluated in this thesis, such as, for instance, the mean square error (MSE) linear classifier, the k-nearest neighbor algorithm, or even, a radial-basis function (RBF) ...pruning ...

270

... [18] Kennedy, J., & Spears, W. M. (1998, May). Matching **algorithms** to problems: an experimental test of the particle swarm and some genetic **algorithms** on the multimodal problem generator. In 1998 IEEE ...

12

... the received solution. In a first place, a comparison of the multicolony **algorithms** is presented by establishing the same effort, a prefixed number of iterations. After that, the view point is changed in order to ...

10

... The growth rate is defined as the ratio of the number of the best solutions in two consecutive generations. Early and late growth rates are calculated respectively, when the proportion of best solution is not ...

16

... models and implementations [13], [16] are designed to exploit this inherent parallel nature of genetic **algorithms**. When implemented as an island model, on behalf of the evolutionary process, migration of ...

12

... In this section we present experiment results for processing pattern queries of length L=10 and L=30 over the DNA text collection. We evaluate the baseline parallel suffix array algor[r] ...

10