Branch-and-Prune Search Strategies for Numerical Constraint Solving.pdfVIP

下载本文档

6
0
约11.91万字
约 43页
2017-04-05 发布于江苏
举报
版权申诉

Branch-and-Prune Search Strategies for Numerical Constraint Solving.pdf

1、本文档共43页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Branch-and-Prune Search Strategies for Numerical Constraint Solving

a r X i v : c s / 0 5 1 2 0 4 5 v 2 [ c s .A I ] 8 M a y 2 0 0 7 Branch-and-Prune Search Strategies for Numerical Constraint Solving Xuan-Ha VU1, Marius-Ca?lin SILAGHI2, Djamila SAM-HAROUD3 and Boi FALTINGS3 1 Cork Constraint Computation Centre, University College Cork (UCC), 14 Washington Street West, Cork, Ireland, Email: ha.vu@4c.ucc.ie; 2 Department of Computer Science, Florida Institute of Technology (FIT), 150 West University Boulevard, Melbourne, FL-32901-6975, USA Email: marius.silaghi@; 3 Artificial Intelligence Laboratory, Ecole Polytechniqe Fe?de?ral de Lausanne (EPFL), Batiment IN, Station 14, CH-1015 Lausanne, Switzerland, Email: jamila.sam@epfl.ch, boi.faltings@epfl.ch. When solving numerical constraints such as nonlinear equations and inequalities, solvers often exploit pruning techniques, which remove redundant value combinations from the domains of variables, at pruning steps. To find the complete solution set, most of these solvers alternate the pruning steps with branching steps, which split each problem into subproblems. This forms the so-called branch-and-prune framework, well known among the approaches for solving numerical constraints. The basic branch-and-prune search strategy that uses domain bisections in place of the branching steps is called the bisection search. In general, the bisection search works well in case (i) the solutions are isolated, but it can be improved further in case (ii) there are continuums of solutions (this often occurs when inequalities are involved). In this paper, we propose a new branch-and-prune search strategy along with several variants, which not only allow yielding better branching decisions in the latter case, but also work as well as the bisection search does in the former case. These new search algorithms enable us to employ various pruning techniques in the construction of inner and outer approximations of the solution set. Our experiments show that these algorithms speed up the solving process of