Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...
Chengqi Zhang, Meiling Liu, Wenlong Nie, Shichao Z...
In the future, voice communication is expected to migrate from the public switched telephone network to the Internet. Because of the particular characteristics (low volume and bur...
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
In several species of ants, workers cooperate to retrieve large prey. Usually, one ant finds a prey item, tries to move it, and when unsuccessful for some time, recruits nestmates...