Sciweavers

1563 search results - page 173 / 313
» Performance comparison of memetic algorithms
Sort
View
133
Voted
BMCBI
2008
107views more  BMCBI 2008»
15 years 3 months ago
A mixture model approach to sample size estimation in two-sample comparative microarray experiments
Background: Choosing the appropriate sample size is an important step in the design of a microarray experiment, and recently methods have been proposed that estimate sample sizes ...
Tommy S. Jørstad, Herman Midelfart, Atle M....
148
Voted
FLAIRS
2009
15 years 1 months ago
Beating the Defense: Using Plan Recognition to Inform Learning Agents
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
Matthew Molineaux, David W. Aha, Gita Sukthankar
134
Voted
BMCBI
2010
152views more  BMCBI 2010»
15 years 3 months ago
Apples and oranges: avoiding different priors in Bayesian DNA sequence analysis
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
Jens Keilwagen, Jan Grau, Stefan Posch, Ivo Grosse
125
Voted
CVPR
2005
IEEE
16 years 5 months ago
Evaluating Image Retrieval
We present a comprehensive strategy for evaluating image retrieval algorithms. Because automated image retrieval is only meaningful in its service to people, performance character...
Nikhil V. Shirahatti, Kobus Barnard
213
Voted
VLDB
2005
ACM
121views Database» more  VLDB 2005»
16 years 3 months ago
Join operations in temporal databases
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
Dengfeng Gao, Christian S. Jensen, Richard T. Snod...