Sciweavers

895 search results - page 77 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
14 years 11 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...
EH
2003
IEEE
100views Hardware» more  EH 2003»
15 years 4 months ago
Learning for Evolutionary Design
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
Sushil J. Louis
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
15 years 11 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
ICCV
2011
IEEE
13 years 5 months ago
Video Parsing for Abnormality Detection
Detecting abnormalities in video is a challenging problem since the class of all irregular objects and behaviors is infinite and thus no (or by far not enough) abnormal training sa...
Borislav Antic, Bjorn Ommer
RECOMB
2007
Springer
15 years 5 months ago
Parts of the Problem of Polyploids in Rearrangement Phylogeny
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
Chunfang Zheng, Qian Zhu, David Sankoff