Sciweavers

3146 search results - page 343 / 630
» Efficient Consequence Finding
Sort
View
TCBB
2008
107views more  TCBB 2008»
15 years 4 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
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...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
CIB
2004
57views more  CIB 2004»
15 years 4 months ago
Identifying Global Exceptional Patterns in Multi-database Mining
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...
CN
2002
85views more  CN 2002»
15 years 4 months ago
Analysis of delay and delay jitter of voice traffic in the Internet
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...
Mansour J. Karam, Fouad A. Tobagi
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 4 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
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...
RAS
2000
90views more  RAS 2000»
15 years 4 months ago
Cooperative transport by ants and robots
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...
C. Ronald Kube, Eric Bonabeau