Some perils of performance prediction: a case study on pattern matching | Zendy

Fenwick Peter | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Some perils of performance prediction: a case study on pattern matching

Author(s) -

Fenwick Peter

Publication year - 2001

Publication title -

software: practice and experience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.437

H-Index - 70

eISSN - 1097-024X

pISSN - 0038-0644

DOI - 10.1002/spe.392

Subject(s) - variety (cybernetics) , matching (statistics) , string searching algorithm , computer science , pattern matching , string (physics) , machine learning , artificial intelligence , algorithm , theoretical computer science , data mining , mathematics , statistics , mathematical physics

Recent experience with string searching or pattern matching algorithms revealed wide discrepancies between predicted and observed performance. Further observations on a variety of computers revealed even greater variations between those algorithms on different computers. These observations are collected here as an example of problems in real‐world comparison of algorithms. Copyright © 2001 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research