Sciweavers

1972 search results - page 359 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
AIPS
2007
15 years 5 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
136
Voted
BIOCOMP
2007
15 years 4 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
Xuehui Li, Tamer Kahveci
115
Voted
IJCAI
2007
15 years 4 months ago
All Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
Hui Wang
110
Voted
UAI
2004
15 years 4 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
135
Voted
ISMB
1996
15 years 4 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal