Sciweavers

8016 search results - page 1247 / 1604
» On the practical genetic algorithms
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 8 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
UAI
2001
15 years 8 months ago
Aggregating Learned Probabilistic Beliefs
We consider the task of aggregating beliefs of several experts. We assume that these beliefs are represented as probability distributions. We argue that the evaluation of any aggr...
Pedrito Maynard-Reid II, Urszula Chajewska
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 8 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
WAE
2001
227views Algorithms» more  WAE 2001»
15 years 8 months ago
Compact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
Gonzalo Navarro, Mathieu Raffinot
NIPS
2003
15 years 8 months ago
Increase Information Transfer Rates in BCI by CSP Extension to Multi-class
Brain-Computer Interfaces (BCI) are an interesting emerging technology that is driven by the motivation to develop an effective communication interface translating human intention...
Guido Dornhege, Benjamin Blankertz, Gabriel Curio,...
« Prev « First page 1247 / 1604 Last » Next »