Sciweavers

789 search results - page 55 / 158
» Modeling and Analysis of Genetic Algorithm with Tournament S...
Sort
View
RTCSA
2007
IEEE
16 years 8 days ago
Scheduling Algorithms for I/O Blockings with a Multi-frame Task Model
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada
ICAPR
2005
Springer
15 years 11 months ago
Discovering Predictive Variables When Evolving Cognitive Models
A non-dominated sorting genetic algorithm is used to evolve models of learning from different theories for multiple tasks. Correlation analysis is performed to identify parameters...
Peter C. R. Lane, Fernand Gobet
BMCBI
2011
15 years 15 days ago
SNPPicker: High quality tag SNP selection across multiple populations
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
Hugues Sicotte, David N. Rider, Gregory A. Poland,...
EDBT
2010
ACM
180views Database» more  EDBT 2010»
16 years 25 days ago
BSkyTree: scalable skyline computation using a balanced pivot selection
Skyline queries have gained a lot of attention for multicriteria analysis in large-scale datasets. While existing skyline algorithms have focused mostly on exploiting data dominan...
Jongwuk Lee, Seung-won Hwang
SAC
2006
ACM
15 years 12 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht