Researchers have developed a novel branch-and-bound algorithm designed to construct cost-optimal decision strategies for evaluating propositional formulas. This algorithm aims to minimize the expected cost by considering variable costs for information acquisition and a probability distribution over truth assignments. The approach includes heuristics for variable selection, pruning, and caching, and is presented as the first practical exact algorithm for this problem. Experiments show scalability and the trade-off between efficiency and quality with a greedy beam-search variant, while theoretical analysis confirms the problem's #P-hard complexity. AI
IMPACT This research could lead to more efficient decision-making algorithms in complex scenarios with variable costs and probabilities.
RANK_REASON The cluster contains a research paper detailing a new algorithm for a specific computational problem.
- alphaXiv
- arXiv
- Branch and bound algorithms to determine minimal evolutionary trees
- CatalyzeX Code Finder for Papers
- CORE Recommender
- DagsHub
- Gotit.pub
- Hugging Face
- Influence Flower
- #P-hard
- PSPACE
- ScienceCast
- Stochastic Boolean Function Evaluation
AI-generated summary · Google Gemini · from 2 sources. How we write summaries →