Sciweavers

1964 search results - page 99 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
IJCAI
2001
13 years 9 months ago
Genetic Algorithm based Selective Neural Network Ensemble
Neural network ensemble is a learning paradigm where several neural networks are jointly used to solve a problem. In this paper, the relationship between the generalization abilit...
Zhi-Hua Zhou, Jianxin Wu, Yuan Jiang, Shifu Chen
CP
2003
Springer
14 years 1 months ago
Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
Meinolf Sellmann
AAAI
2004
13 years 9 months ago
The Practice of Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
Meinolf Sellmann
SAC
2006
ACM
14 years 1 months ago
A scalable algorithm for high-quality clustering of web snippets
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
Filippo Geraci, Marco Pellegrini, Paolo Pisati, Fa...
ISMB
2000
13 years 9 months ago
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
The next phase of human genomics will involve largescale screens of populations for signi cant DNA polymorphisms, notably single nucleotide polymorphisms SNP's. Dense human S...
Dan Gusfield