Pages that link to "Item:Q1393276"
From MaRDI portal
The following pages link to Performance bounds on the splitting algorithm for binary testing (Q1393276):
Displaying 6 items.
- Coping with known patterns of lies in a search game (Q797505) (← links)
- A unifying framework for trie design heuristics (Q911258) (← links)
- Performances of an algorithm constructing a nearly optimal binary tree (Q1056546) (← links)
- The game of ''\(N\) questions'' of a tree (Q1243263) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- Decision tree design by simulated annealing (Q4278040) (← links)
