Pages that link to "Item:Q696973"
From MaRDI portal
The following pages link to Query strategies for priced information (Q696973):
Displaying 16 items.
- Evaluation of monotone DNF formulas (Q521804) (← links)
- Competitive evaluation of threshold functions in the priced information model (Q646704) (← links)
- The hardness of the expected decision depth problem (Q845910) (← links)
- A note on the size of minimal covers (Q845985) (← links)
- A randomized competitive algorithm for evaluating priced AND/OR trees (Q935154) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Computing similarity distances between rankings (Q2410235) (← links)
- Finding optimal satisficing strategies for and-or trees (Q2457646) (← links)
- Sorting and Selection with Random Costs (Q5458516) (← links)
- Generalized sorting with predictions revisited (Q6535798) (← links)
- Energy efficient sorting, selection and searching (Q6548954) (← links)
- Simple algorithms for stochastic score classification with small approximation ratios (Q6573003) (← links)
