1418 search results - page 271 / 284 » The Dynamic Complexity of Formal Languages |
108
click to vote
ASE
2005
14 years 11 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
104
click to vote
LOGCOM
2010
14 years 6 months ago
2010
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
103
click to vote
KDD
2007
ACM
16 years 4 days ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
104
click to vote
ICIW
2009
IEEE
15 years 6 months ago
2009
IEEE
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
119
click to vote
BIBE
2008
IEEE
15 years 6 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...