检索结果-内蒙古大学图书馆

22nd international conference on principles and practice of constraint programming, cp 2016

ISBN: (纸本)9783319449524

The proceedings contain 55 papers. The special focus in this conference is on Technical Track, Application Track, Computational Sustainability Track, cp, Biology Track, Music Track, Preference, Social Choice, Optimization Track, Testing and Verification Track. The topics include: Exploiting short supports for improved encoding of arbitrary constraints into SAT;an adaptive parallel SAT solver;improved linearization of constraint programming models;impact of SAT-based preprocessing on core-guided MaxSAT solving;multiobjective optimization by decision diagrams;dependency schemes in QBF calculi;the multirate resource constraint;the dichotomy for conservative constraint satisfaction is polynomially decidable;the vertex cover constraint;extending broken triangles and enhanced value-merging;a bounded path propagator on directed graphs;interval constraints with learning: application to air traffic control;backdoors to tractable valued CSP;monte-carlo tree search for the maximum satisfiability problem;on finding minimum satisfying assignments;towards a dynamic decomposition of CSPs with separators of bounded size;a global constraint for closed frequent pattern mining;parallel strategies selection;learning parameters for the sequence constraint from solutions;explaining producer/consumer constraints;learning from learning solvers;on incremental core-guided MaxSAT solving;an implementation of MIP and cp for interactive soccer queries;solving a supply-delivery scheduling problem with constraint programming;availability optimization in cloud-based in-memory data grids;constraining redundancy to improve protein docking;finding alternative musical scales;morphing between stable matching problems;the power of propagation: when GAC is enough and AHP based portfolio selection with risk preference modeling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tightness of LP Relaxations for Almost Balanced Models 22nd

Tightness of LP Relaxations for Almost Balanced Models

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Weller, Adrian Rowland, Mark Sontag, David Univ Cambridge Cambridge England NYU New York NY USA

We examine Boolean binary weighted constraint satisfaction problems and derive sufficient conditions for when certain linear programming (LP) relaxations are guaranteed to return an integer solution, in which case the... 详细信息

ISBN: (纸本)9783319449531;9783319449524

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

The power of propagation: when GAC is enough

引用

constraintS 2017年第1期22卷 3-23页

作者： Cohen, David A. Jeavons, Peter G. Royal Holloway Univ London Dept Comp Sci Egham Surrey England Univ Oxford Dept Comp Sci Oxford England

Considerable effort in constraint programming has focused on the development of efficient propagators for individual constraints. In this paper, we consider the combined power of such propagators when applied to collections of more than one constraint. In particular we identify classes of constraint problems where such propagators can decide the existence of a solution on their own, without the need for any additional search. Sporadic examples of such classes have previously been identified, including classes based on restricting the structure of the problem, restricting the constraint types, and some hybrid examples. However, there has previously been no unifying approach which characterises all of these classes: structural, language-based and hybrid. In this paper we develop such a unifying approach and embed all the known classes into a common framework. We then use this framework to identify a further class of problems that can be solved by propagation alone.

关键词： constraint satisfaction Arc-consistency Global constraints Propagators

来源：评论

学校读者我要写书评

暂无评论

Mixed-Integer and constraint programming Techniques for Mobile Robot Task Planning 22nd

Mixed-Integer and Constraint Programming Techniques for Mobi...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Booth, Kyle E. C. Tran, Tony T. Nejat, Goldie Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada

ISBN: (纸本)9783319449531;9783319449524

In this work we investigate the application of optimization-based scheduling technologies to two mobile robot task planning problems. We develop and apply mixed-integer programming (MIP) and constraint programming (cp) techniques to model and solve these problems, demonstrating through simulation that our methods outperform those previously proposed in the robotics literature. Our simulation further indicates that the inference-based search of cp is the superior approach for the problems studied. Additionally, we implement our cp approach for the second problem as a task planning module within a real robotics platform on the social robot Tangy, validating the physical utility of the method. © Springer international Publishing Switzerland 2016.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

"Almost-stable" matchings in the Hospitals/Residents problem with Couples

引用

constraintS 2017年第1期22卷 50-72页

作者： Manlove, David F. McBride, Iain Trimble, James Univ Glasgow Sch Comp Sci Sir Alwyn Williams Bldg Glasgow G12 8QQ Lanark Scotland

The Hospitals / Residents problem with Couples (hrc) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that a stable matching need not exist, so we consider min bp hrc, the problem of finding a matching that admits the minimum number of blocking pairs (i.e., is "as stable as possible"). We show that this problem is NP-hard and difficult to approximate even in the highly restricted case that each couple finds only one hospital pair acceptable. However if we further assume that the preference list of each single resident and hospital is of length at most 2, we give a polynomial-time algorithm for this case. We then present the first Integer programming (IP) and constraint programming (cp) models for min bp hrc. Finally, we discuss an empirical evaluation of these models applied to randomly-generated instances of min bp hrc. We find that on average, the cp model is about 1.15 times faster than the IP model, and when presolving is applied to the cp model, it is on average 8.14 times faster. We further observe that the number of blocking pairs admitted by a solution is very small, i.e., usually at most 1, and never more than 2, for the (28,000) instances considered.

关键词： Most-stable matching Blocking pair Polynomial-time algorithm NP-hardness Integer programming model constraint programming model Empirical evaluation

来源：评论

学校读者我要写书评

暂无评论

Enhancing Partial Symmetry Breaking in constraint programming 22nd

Enhancing Partial Symmetry Breaking in Constraint Programmin...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Lee, Jimmy H. M. Zhu, Zichen Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China

ISBN: (纸本)9783319449531;9783319449524

Symmetries are common in many constraint problems. They can be broken statically or dynamically. Static methods alter the original problem by adding new constraints to remove symmetric solutions. In contrast, dynamic methods modify the search procedure to exclude exploration of symmetric regions. Practical symmetry breaking methods often trade completeness for efficiency by only breaking a subset of symmetries. The pruning power of partial symmetry breaking depends on the given subset of symmetries to break as well as the extra composition symmetries that are broken by the interactions among symmetry breaking constraints. © Springer international Publishing Switzerland 2016.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

STR3: A Path-Optimal Filtering Algorithm for Table constraints 22nd

STR3: A Path-Optimal Filtering Algorithm for Table Constrain...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Lecoutre, Christophe Likitvivatanavong, Chavalit Yap, Roland H. C. Univ Artois CRIL CNRS UMR 8188 F-62307 Lens France Natl Univ Singapore Sch Comp Singapore Singapore

ISBN: (纸本)9783319449531;9783319449524

constraint propagation is fundamental to constraint programming (cp). Many algorithms have been proposed over the years to enforce the property called Generalized Arc Consistency (GAC) — the most used form of propagation on many types of constraints, including table constraints. Out of the many GAC algorithmic ideas for table constraints, an approach called simple tabular reduction (STR) which maintains the tables of constraints by removing invalid tuples has been show to be effective. In particular, STR2, a refined STR variant is among the most efficient GAC algorithms for positive table constraints. © Springer international Publishing Switzerland 2016.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint programming for planning test campaigns of communications satellites

引用

constraintS 2017年第1期22卷 73-89页

作者： Hebrard, Emmanuel Huguet, Marie-Jose Veysseire, Daniel Sauvan, Ludivine Boche Cabon, Bertrand Univ Toulouse LAAS CNRS INSA Toulouse France Airbus Def & Space Toulouse France

The payload of communications satellites must go through a series of tests to assert their ability to survive in space. Each test involves some equipment of the payload to be active, which has an impact on the temperature of the payload. Sequencing these tests in a way that ensures the thermal stability of the payload and minimizes the overall duration of the test campaign is a very important objective for satellite manufacturers. The problem can be decomposed in two sub-problems corresponding to two objectives: First, the number of distinct configurations necessary to run the tests must be minimized. This can be modeled as packing the tests into configurations, and we introduce a set of implied constraints to improve the lower bound of the model. Second, tests must be sequenced so that the number of times an equipment unit has to be switched on or off is minimized. We model this aspect using the constraint Switch, where a buffer with limited capacity represents the currently active equipment units, and we introduce an improvement of the propagation algorithm for this constraint. We then introduce a search strategy in which we sequentially solve the sub-problems (packing and sequencing). Experiments conducted on real and random instances show the respective interest of our contributions.

关键词： Sequencing Communications satellites Global constraint

来源：评论

学校读者我要写书评

暂无评论

Availability Optimization in Cloud-Based In-Memory Data Grids 22nd

Availability Optimization in Cloud-Based In-Memory Data Grid...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Sebbah, Samir Bagley, Claire Colena, Mike Kadioglu, Serdar Oracle Corp Burlington MA 01803 USA

ISBN: (纸本)9783319449531;9783319449524

This paper presents a constraint programming (cp)-based application for dynamic cache distribution in Oracle Coherence In-Memory Data Grid (IMDG). A re-sizable decomposition method using cp is developed to ensure high availability through incremental optimization of load distribution and data replication. The application highlights the flexibility and efficiency that the cp technology offers for (1) concisely capturing the multiple dynamic aspects and complex constraints of the Oracle Coherence IMDG cache distribution problem;and (2) solving large-scale problem instances in a dynamic cloud environment. Extensive computational results are presented to assess the scalability and efficiency of the proposed solution.

关键词： constraint programming Re-sizable decomposition Oracle Coherence Dynamic Cache Distribution Availability Resiliency

来源：评论

学校读者我要写书评

暂无评论

Boosting Symmetry Breaking During Search in constraint programming 22nd

Boosting Symmetry Breaking During Search in Constraint Progr...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Lee, Jimmy H. M. Zhu, Zichen Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China

ISBN: (纸本)9783319449531;9783319449524

Symmetries can be broken statically or dynamically. Advantages of dynamic symmetry breaking methods include ability to break symmetries of arbitrary kinds and compatibility with variable and value heuristics. When considering runtime, dynamic methods often lose out to widely used static methods, such as the LexLeader method and value precedence. The focus of this paper is dynamic symmetry breaking, in particular the symmetry breaking during search (SBDS) method that adds conditional symmetry breaking constraints during search. © Springer international Publishing Switzerland 2016.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：