✦ LIBER ✦

AN EFFICIENT ALGORITHM FOR THE SHANNON SWITCHING GAME

✍ Scribed by Lee J. White

Book ID: 114879210
Publisher: John Wiley and Sons
Year: 1970
Tongue: English
Weight: 113 KB
Volume: 175
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1970.tb56500.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A solution to the Misère Shannon switchi

A solution to the Misère Shannon switching Game

✍ Yahya Ould Hamidoune; Michel Las Vergnas 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let G be a graph and x0, x, be two different vertices of G. Two players, Black and White, mark alternately non marked edges of G. White loses if and only if he marks all edges of a path connecting xc, and xr. This game is the misere version of the well-known Shannon Switching Game. We give its class

An efficient distributed algorithm for g

An efficient distributed algorithm for game tree search

✍ Sun Wei; Ma Shaohan 📂 Article 📅 1996 🏛 Wuhan University 🌐 English ⚖ 223 KB

An algorithm for discounted Switching Co

An algorithm for discounted Switching Control Stochastic Games

✍ S. R. Mohan; T. E. S. Raghavan 📂 Article 📅 1987 🏛 Springer 🌐 German ⚖ 360 KB

An efficient scheduling algorithm for in

An efficient scheduling algorithm for input-queued switches

✍ Qingsheng Hu; Yuan Sun; Jiangtao Han 📂 Article 📅 2007 🏛 SP Science Press 🌐 English ⚖ 195 KB

A finite algorithm for the switching con

A finite algorithm for the switching control stochastic game

✍ O. J. Vrieze; S. H. Tijs; T. E. S. Raghavan; J. A. Filar 📂 Article 📅 1983 🏛 Springer 🌐 German ⚖ 728 KB

An efficient algorithm for supertrees

✍ Mariana Constantinescu; David Sankoff 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 514 KB