๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of asynchronous model based testing

โœ Scribed by Robert M. Hierons

Book ID
116907385
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
280 KB
Volume
451
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sample Complexity of Model-Based Search
Sample Complexity of Model-Based Search
โœ Christopher D. Rosin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

We consider the problem of searching a domain for points that have a desired property, in the special case where the objective function that determines the properties of points is unknown and must be learned during search. We give a parallel to PAC learning theory that is appropriate for reasoning a

The Complexity of Forecast Testing
The Complexity of Forecast Testing
โœ Lance Fortnow; Rakesh V. Vohra ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 134 KB
The complexity of planarity testing
The complexity of planarity testing
โœ Eric Allender; Meena Mahajan ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 321 KB
On the complexity of diagram testing
On the complexity of diagram testing
โœ Graham Brightwell ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 483 KB