✦ LIBER ✦

An estimate of the number of comparisons for optimal decision algorithms

✍ Scribed by V. V. Morozov

Publisher: Springer
Year: 1991
Tongue: English
Weight: 315 KB
Volume: 2
Category: Article
ISSN: 1046-283X
DOI: 10.1007/bf01127957

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An intrinsic bound for the number of obs

An intrinsic bound for the number of observations in an optimal sequential decision problem

✍ G. Andreatta; G. Romanin-Jacur 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 976 KB

H. Almuallim, An efficient algorithm for

H. Almuallim, An efficient algorithm for optimal of decision trees

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Situations in which them is competition among possible contractor agents or possible manager agents are also considered. In all situations we assume that the contractor can choose a level of effort when carrying out the task and we would like the contractor to carry out the task efficiently without

Estimating the number of decision coalit

Estimating the number of decision coalitions

✍ Yu. A. Shreider 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 298 KB

Lower estimate of the number of steps fo

Lower estimate of the number of steps for an inverting normal algorithm and other similar algorithms

✍ G. S. Tseitin 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 768 KB

Reduction of dimensionality of an optima

Reduction of dimensionality of an optimal decision table conversion algorithm

✍ Art Lew 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 630 KB

An algorithm to find the number of paral

An algorithm to find the number of parallel stations for optimal cell scheduling

✍ Gursel A. Suer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 271 KB