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

Detecting errors in searching games

โœ Scribed by Andrzej Pelc


Book ID
107885116
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
742 KB
Volume
51
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Optimal comparison strategies in Ulam's
โœ Daniele Mundici; Alberto Trombetta ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 974 KB

Suppose x is an n-bit integer. By a comparison question we mean a question of the form "does x satisfy either condition a <x< b or c<x<d?". We describe strategies to find x using the smallest possible number q(n) of comparison questions, and allowing up to two of the answers to be erroneous. As pro

On Detecting Errors in Dependency Treeba
โœ Adriane Boyd; Markus Dickinson; W. Detmar Meurers ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer ๐ŸŒ English โš– 518 KB
Search game in a rectangle
โœ A. Yu. Garnaev ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer ๐ŸŒ English โš– 426 KB
Error Propagation in Game Trees
โœ Benjamin Doerr; Ulf Lorenz ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer ๐ŸŒ English โš– 207 KB