.png){kind=icon}
返回
Confidence-based reasoning in stochastic constraint programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2015.07.004.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this work we introduce a novel approach, based on sampling, for finding assignments that are likely to be solutions to stochastic constraint satisfaction problems and constraint optimisation problems. Our approach reduces the size of the original problem being analysed; by solving this reduced problem, with a given confidence probability, we obtain assignments that satisfy the chance constraints in the original model within prescribed error tolerance thresholds. To achieve this, we blend concepts from stochastic constraint programming and statistics. We discuss both exact and approximate variants of our method. The framework we introduce can be immediately employed in concert with existing approaches for solving stochastic constraint programs. A thorough computational study on a number of stochastic combinatorial optimisation problems demonstrates the effectiveness of our approach. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Confidence-based reasoning
Stochastic constraint programming
Sampled SCSP
(alpha, theta)-solution
(alpha, theta)-solution set
Confidence interval analysis
Global chance constraint
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
分享收藏Analysis of prognostic factors in male breast cancer: a report of 72 cases from a single institution
OAAI
OAAI分享收藏
查看更多内容