Competitive evaluation of threshold functions in the priced information model
From MaRDI portal
Publication:646704
DOI10.1007/s10479-009-0622-4zbMath1254.90117OpenAlexW1973215126MaRDI QIDQ646704
Martin Milanič, Ferdinando Cicalese
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0622-4
Related Items
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case ⋮ Directed Projection Graph of N-Dimensional Hypercube and Subhypercube Decomposition of Balanced Linearly Separable Boolean Functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial characterization of read-once formulae
- Query strategies for priced information
- On read-once threshold formulae and their randomized decision tree complexity
- Geometric algorithms and combinatorial optimization
- Artificial intelligence and Mathematics IX. Selected papers from the 5th international symposium, Fort Lauderdale, FL, USA, January 2--5, 1998
- Discrete Mathematics of Neural Networks
- Function Evaluation Via Linear Programming in the Priced Information Model
- A new strategy for querying priced information
- How to assign votes in a distributed system
- Disjoint Products and Efficient Computation of Reliability
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- Algorithms – ESA 2005
- On the competitive ratio of evaluating priced functions
