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

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

作者： Lazaar, Nadjib Lebbah, Yahia Loudni, Samir Maamar, Mehdi Lemiere, Valentin Bessiere, Christian Boizumault, Patrice Univ Montpellier LIRMM Montpellier France Univ Oran 1 Ahmed Ben Bella LITIO Oran Algeria Normandie Univ GREYC Caen France

ISBN: (纸本)9783319449531;9783319449524

Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent constraint programming (cp) approaches for declarative itemset mining have proven their usefulness and flexibility. But the wide use of reified constraints in current cp approaches leads to difficulties in coping with high dimensional datasets. In this paper, we propose the CLOSEDPATTERN global constraint to capture the closed frequent pattern mining problem without requiring reified constraints or extra variables. We present an algorithm to enforce domain consistency on CLOSEDPATTERN in polynomial time. The computational properties of this algorithm are analyzed and its practical effectiveness is experimentally evaluated.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

constraint programming for Strictly Convex Integer Quadratically-Constrained Problems 22nd

Constraint Programming for Strictly Convex Integer Quadratic...

引用

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

作者： Ku, Wen-Yang Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada

ISBN: (纸本)9783319449531;9783319449524

Inspired by the geometric reasoning exploited in discrete ellipsoid-based search (DEBS) from the communications literature, we develop a constraint programming (cp) approach to solve problems with strictly convex quadratic constraints. Such constraints appear in numerous applications such as modelling the ground-to-satellite distance in global positioning systems and evaluating the efficiency of a schedule with respect to quadratic objective functions. We strengthen the key aspects of the DEBS approach and implement them as combination of a global constraint and variable/value ordering heuristics in IBM ILOG cp Optimizer. Experiments on a variety of benchmark instances show significant improvement compared to the default settings and state-of-the-art performance compared to competing technologies of mixed integer programming, semi-definite programming, and mixed integer nonlinear programming.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Finding Alternative Musical Scales 22nd

Finding Alternative Musical Scales

引用

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

作者： Hooker, J. N. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9783319449531;9783319449524

We search for alternative musical scales that share the main advantages of classical scales: pitch frequencies that bear simple ratios to each other, and multiple keys based on an underlying chromatic scale with tempered tuning. We conduct the search by formulating a constraint satisfaction problem that is well suited for solution by constraint programming. We find that certain 11-note scales on a 19-note chromatic stand out as superior to all others. These scales enjoy harmonic and structural possibilities that go significantly beyond what is available in classical scales and therefore provide a possible medium for innovative musical composition.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Decomposition of the Factor Encoding for CSPs 22nd

Decomposition of the Factor Encoding for CSPs

引用

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

作者： Likitvivatanavong, Chavalit Xia, Wei Yap, Roland H. C. Natl Univ Singapore Sch Comp Singapore Singapore

ISBN: (纸本)9783319449531;9783319449524

Generalized arc consistency (GAC) is one of the ways for reducing the search space when solving constraint satisfaction problems (CSPs). With so many GAC algorithms having been developed, GAC is invariably implemented in most solvers in one form or another. Consistencies stronger than GAC can further reduce the search space and have also been shown useful, but designing and implementing such algorithms to be competitive with the state-of the-art solvers employing GAC turns out to be a challenge. Higher-order consistency properties include relational consistency, max-restricted pairwise consistency, and full pairwise consistency (FPWC). © Springer international Publishing Switzerland 2016.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Solving a Supply-Delivery Scheduling Problem with constraint programming 22nd

Solving a Supply-Delivery Scheduling Problem with Constraint...

引用

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

作者： Giles, Katherine van Hoeve, Willem-Jan Carnegie Mellon Univ Tepper Sch Business 5000 Forbes Ave Pittsburgh PA 15213 USA

ISBN: (纸本)9783319449531;9783319449524

We describe a constraint programming approach for a supply-delivery problem in the petrochemical industry, in which barges transport liquid material from supplier locations to downstream processing plants. The problem is to design a pickup-and-delivery route for each barge such that given minimum and maximum inventory levels at each location are met for a given fleet size. This optimization problem is part of a larger planning system to determine the fleet size, negotiate pickup windows and quantities, and design operational schedules. We evaluate our model on representative supply networks provided by BP North America, and contrast our results with those obtained by a mixed-integer programming approach.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Propagation via Kernelization: The Vertex Cover constraint 22nd

Propagation via Kernelization: The Vertex Cover Constraint

引用

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

作者： Carbonnel, Clement Hebrard, Emmanuel Univ Toulouse LAAS CNRS CNRS INP Toulouse France

ISBN: (纸本)9783319449531;9783319449524

The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient parameterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming. We study the use of kernelization for designing propagators through the example of the Vertex Cover constraint. Since the classic kernelization rules often correspond to dominance rather than consistency, we introduce the notion of "loss-less" kernel. While our preliminary experimental results show the potential of the approach, they also show some of its limits. In particular, this method is more effective for vertex covers of large and sparse graphs, as they tend to have, relatively, smaller kernels.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Graphical models for optimal power flow

引用

constraintS 2017年第1期22卷 24-49页

作者： Dvijotham, Krishnamurthy Chertkov, Michael Van Hentenryck, Pascal Vuffray, Marc Misra, Sidhant CALTECH Comp & Math Sci Pasadena CA 91125 USA Los Alamos Natl Lab T Div Los Alamos NM USA Los Alamos Natl Lab Ctr Nonlinear Studies Los Alamos NM USA Univ Michigan Ind & Operat Engn Ann Arbor MI 48109 USA

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (cp) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for "smart grid" applications like control of distributed energy resources. Numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

关键词： constraint programming Graphical models Power systems

来源：评论

学校读者我要写书评

暂无评论

constraint programming for Planning Test Campaigns of Telecommunication Satellites 22nd

Constraint Programming for Planning Test Campaigns of Teleco...

引用

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

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

ISBN: (纸本)9783319449531;9783319449524

The payload of a satellite is the equipment that actually performs the mission, it receives, amplifies and emits back the signal. Before launch, the equipment of the payload must be tested under a simulated space environment. A set of tests are necessary for certifying that the payload can perform its mission in space. Each test is characterized by a set of activated equipment units and several thermal constraints limit the number of equipment units that can be activated simultaneously. The duration of the tests themselves is incompressible. However, activating some equipment takes time as each equipment unit much reach a given temperature and the temperature of the entire payload must be stabilized before tests can resume. Then, the transition time between tests depends on the order in which tests are sequenced. © Springer international Publishing Switzerland 2016.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Learning Parameters for the Sequence constraint from Solutions 22nd

Learning Parameters for the Sequence Constraint from Solutio...

引用

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

作者： Picard-Cantin, Emilie Bouchard, Mathieu Quimper, Claude-Guy Sweeney, Jason Univ Laval 2325 Rue Univ Quebec City PQ G1V 0A6 Canada PetalMD 350 Blvd Charest Est Quebec City PQ G1K 3H5 Canada

ISBN: (纸本)9783319449531;9783319449524

This paper studies the problem of learning parameters for global constraints such as Sequence from a small set of positive examples. The proposed technique computes the probability of observing a given constraint in a random solution. This probability is used to select the more likely constraint in a list of candidates. The learning method can be applied to both soft and hard constraints.

关键词： constraint acquisition Timetabling Machine learning CSP Global constraints Solution counting Markov chain Soft constraints

来源：评论

学校读者我要写书评

暂无评论

constraint programming Approach to the Problem of Generating Milton Babbitt's All-Partition Arrays 22nd

Constraint Programming Approach to the Problem of Generating...

引用

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

作者： Tanaka, Tsubasa Bemman, Brian Meredith, David UPMC CNRS STMS Lab IRCAM Paris France Aalborg Univ Aalborg Denmark

ISBN: (纸本)9783319449531;9783319449524

Milton Babbitt (1916-2011) was a composer of twelve-tone serial music noted for creating the all-partition array. One part of the problem in generating an all-partition array requires finding a covering of a pitch-class matrix by a collection of sets, each forming a region containing 12 distinct elements and corresponding to a distinct integer partition of 12. constraint programming (cp) is a tool for solving such combinatorial and constraint satisfaction problems. In this paper, we use cp for the first time to formalize this problem in generating an all-partition array. Solving the whole of this problem is difficult and few known solutions exist. Therefore, we propose solving two sub-problems and joining these to form a complete solution. We conclude by presenting a solution found using this method. Our solution is the first we are aware of to be discovered automatically using a computer and differs from those found by composers.

关键词： Babbitt All-partition array Computational musicology constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：