Sciweavers

712 search results - page 53 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
AAAI
2000
15 years 4 months ago
A Method for Clustering the Experiences of a Mobile Robot that Accords with Human Judgments
If robotic agents are to act autonomously they must have the ability to construct and reason about models of their physical environment. For example, planning to achieve goals req...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
RECOMB
2000
Springer
15 years 6 months ago
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
Xin Chen, Sam Kwong, Ming Li
COMPLEXITY
2004
165views more  COMPLEXITY 2004»
15 years 2 months ago
Sex promotes gamete selection: A quantitative comparative study of features favoring the evolution of sex
: Explaining the maintenance of sexual reproduction remains one of the greatest challenges in biology. The theoretical oddity of sex is based on at least three advantages that asex...
Klaus Jaffe
107
Voted
JAIR
2008
120views more  JAIR 2008»
15 years 2 months ago
Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
Saher Esmeir, Shaul Markovitch
PPOPP
2012
ACM
13 years 10 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal