Efficient Algorithms for Minimax Decisions Under Tree-Structured Incompleteness

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-29765-7_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Efficient Algorithms for Heavy-Tail Analysis Under Interval Uncertainty

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2011English

Monte-Carlo Tree Search and Minimax Hybrids

2013English

Group Structured Reasoning for Coalescing Group Decisions

Group Decision and Negotiation
ArtsManagementHumanitiesDecision SciencesStrategyInnovationManagement of TechnologySocial Sciences
2009English

Errata to “Tree Colors: Color Schemes for Tree-Structured Data”

IEEE Transactions on Visualization and Computer Graphics
Computer GraphicsPattern RecognitionComputer VisionComputer-Aided DesignSignal ProcessingSoftware
2015English

On the Need for Special Purpose Algorithms for Minimax Eigenvalue Problems

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
1989English

Learning Tree-Structured Quantizers for Image Categorization

2011English

Improved Approximation Algorithms for Tree Alignment

Journal of Algorithms
1997English

Minimax Portfolio Optimization Under Interval Uncertainty

Journal of Advanced Computational Intelligence and Intelligent Informatics
Computer VisionPattern RecognitionHuman-Computer InteractionArtificial Intelligence
2015English

Tree-Structured Decoding for Solving Math Word Problems

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy