✦ LIBER ✦

Nonconvergence of the Minimax Order Algorithm

✍ Scribed by Gordon D. Murray

Book ID: 124289172
Publisher: Oxford University Press
Year: 1983
Tongue: English
Weight: 228 KB
Volume: 70
Category: Article
ISSN: 0006-3444
DOI: 10.2307/2335565

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonconvergence in the theory of random o

Nonconvergence in the theory of random orders

✍ Joel Spencer 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 392 KB

There are sentences in the first order theory of partial orders for whom the limit probability of the sentence holding for the random partial order of dimension two does not exist. Furthermore there is no decision procedure that distinguishes those sentences which hold almost surely from those which

Algorithms for the minimax transportatio

Algorithms for the minimax transportation problem

✍ R. K. Ahuja 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

An algorithm for the minimax weber probl

An algorithm for the minimax weber problem

✍ Søren Kruse Jacobsen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Nonconvergence of the Ehrenfest thought

Nonconvergence of the Ehrenfest thought experiment

✍ MacCluer, C. R. 📂 Article 📅 2009 🏛 American Institute of Physics 🌐 English ⚖ 398 KB

Minimax observers of full and reduced or

Minimax observers of full and reduced order

✍ D. V. Balandin; M. M. Kogan 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 288 KB

A comparison of minimax tree search algo

A comparison of minimax tree search algorithms

✍ Murray S. Campbell; T.A. Marsland 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is