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

16th Annual international conference on the principles and practice of constraint programming

作者： Lesaint, David Mehta, Deepak O'Sullivan, Barry Quesada, Luis Wilson, Nic BT Research and Technology BT United Kingdom Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642153952

Personalisation and context-awareness are fundamental concerns in Telephony. this paper introduces a rule-based system - 4CRULES - which enables context-sensitive call control by the means of feature configuration rules. 4CRULES is interoperable with standard context services and compositional feature architectures. It has been designed to resolve feature interactions, manage conflicting preferences, and mitigate the uncertainty affecting context data. this is achieved through a constraint optimisation model that maximises adherence to user requirements and domain constraints. Experiments on a suite of instances confirm the practicality of the approach and highlight performance- and adherence-critical factors.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Optimization of Simple Tabular Reduction for Table constraints

引用

14th international conference on principles and practice of constraint programming (cp 2008)

作者： Lecoutre, Christophe Univ Lille Nord France CRIL CNRS UMR 8188 F-62307 Lens France

ISBN: (纸本)9783540859574

Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to compress their representation. We show that simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of Supports, is very often the most efficient practical approach to enforce generalized arc consistency within MAC. We also describe an optimization of STR which allows limiting the number of operations related to validity checking or search of supports. Interestingly enough, this optimization makes STIR potentially r times faster where r is the arity of the constraint(s). the results of an extensive experimentation that we have conducted with respect to random and structured instances indicate that the optimized algorithm we propose is usually around twice as fast its the original STR and can be up to one order of magnitude faster than previous state-of-the-art algorithms on some series of instances.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A Circuit constraint for Multiple Tours Problems 1

引用

24th international conference on the principles and practice of constraint programming (cp)

作者： Vismara, Philippe Briot, Nicolas Univ Montpellier CNRS LIRMM Montpellier France Univ Montpellier INRA Montpellier SupAgro MISTEA Montpellier France

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

Routing problems appear in many practical applications. In the context of constraint programming, circuit constraints have been successfully developed to handle problems like the well-known Traveling Salesman Problem or the Vehicle Routing Problem. these kind of constraints are linked to the search for a Hamiltonian circuit in a graph. In this paper we consider a more general multiple tour problem that consists in covering a part of the graph with a set of minimal cost circuits. We define a new global constraint WEIGHTEDSUBCIRCUITS that generalizes the WeightedCircuit constraint by releasing the need to obtain a Hamiltonian circuit. It enforces multiple disjoint circuits of bounded total cost to partially cover a weighted graph, the subsets of vertices to be covered being induced by external constraints. We show that enforcing Bounds Consistency for WeightedSubCircuits is NP-hard. We propose an incomplete but polynomial filtering method based on the search for a lower bound of a weighted Steiner circuit.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Applying ad-hoc global constraints with the case constraint to still-life

引用

constraintS 2006年第2-3期11卷 91-114页

作者： Cheng, Kenil C. K. Yap, Roland H. C. Natl Univ Singapore Sch Comp Singapore 117548 Singapore

the Still-Life problem is challenging for cp techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this paper, we show how ad hoc global case constraints can be customized to construct various models to provide much stronger propagation with cp solvers. Since we use custom ad hoc constraints of high arity where the number of tuples to define the constraint are large, the actual constraint representation becomes important to avoid excessive space consumption. We demonstrate how to use BDDs to construct good representations for the case constraint which is critical for efficiency. Our results seem comparable to hybrid cp/IP models even though we are only using propagation albeit on ad hoc global constraints. this paper shows an extensive example of how to systematically build models using different kinds of ad hoc constraints. It also demonstrates the solving potential of ad hoc global constraints.

关键词： modeling binary decision diagram still-life problem ad-hoc constraint non-binary constraint

来源：评论

学校读者我要写书评

暂无评论

Exploiting bipartiteness to identify yet another tractable subclass of CSP 5th

引用

5th international conference on principles and practice of constraint programming (cp 99)

作者： Bjäreland, M Jonsson, P Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

ISBN: (纸本)3540666265

the class of constraint satisfaction problems (CSPs) over finite domains has been shown to be NP-complete, but many tractable subclasses have been identified in the literature. In this paper we are interested in restrictions on the types of constraint relations in CSP instances. By a result of Jeavons et al. we know that a key to the complexity of classes arising from such restrictions is the closure properties of the sets of relations. It has been shown that sets of relations that are closed under constant, majority, affine, or associative, commutative, and idempotent (ACI) functions yield tractable subclasses of CSP. However, it has been unknown whether other closure properties may generate tractable subclasses. In this paper we introduce a class of tractable (in fact, SL-complete) CSPs based on bipartite graphs. We show that there are members of this class that are not closed under constant, majority, affine, or ACI functions, and that it, therefore, is incomparable with previously identified classes.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Applying constraint programming to Identification and Assignment of Service Professionals

Applying Constraint Programming to Identification and Assign...

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Asaf, Sigal Eran, Haggai Richter, Yossi Connors, Daniel P. Gresh, Donna L. Ortega, Julio Mcinnis, Michael J. Univ Haifa Campus IBM Haifa Res Lab IL-31905 Haifa Israel Thomas J Watson Res Ctr IBM Res Div Yorktown Hts NY USA IBM Global Business Serv Dallas TX 1503 USA IBM Global Business Serv Southbury CT 06488 USA

ISBN: (纸本)9783642153952

Today many companies face the challenge of matching highly-skilled professionals to high-end positions in large organizations and human deployment agencies. Non-accurate matches in these businesses can result in significant monetary losses and other negative effects. Unlike traditional Workforce Management (WM) problems such as shift scheduling, highly-skilled employees are professionally distinguishable from each other and hence non-interchangeable. therefore, the techniques used for shift-scheduling can't be applied to the highly-skilled WM domain. Our work focuses on providing a constraint programming solution for supporting the assignment of highly-skilled professionals. Our experience shows that cp is well adapted to this problem. cp supports very well the underlying constraints. In addition, the rich expressive language supported by cp allows us to provide a convenient mechanism for changing and adding new matching and preference constraints. Based on this technology, we have built a tool that is currently being used by IBM service organizations and provides strong business results.

关键词： Human resource management

来源：评论

学校读者我要写书评

暂无评论

Box constraint collections for adhoc constraints

引用

9th international conference on principles and practice of constraint programming, cp 2003

作者： Cheng, Chi Kan Lee, Jimmy Ho Man Stuckey, Peter J. Dept of Comp. Sci. and Eng The Chinese University of Hong Kong Hong Kong Dept. of Comp. Sci. and Soft. Eng University of Melbourne Australia

ISBN: (纸本)3540202021

In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation achieves domain consistency. We develop an algorithm to automatically generate a box constraint collection for a given adhoc constraint. the result is guaranteed to be complete and correct, and achieve domain consistency. the constructive disjunction propagator for the box constraint collection can be efficiently implemented using indexicals. We give correctness and completeness result for our compilation scheme, and outline optimization techniques. Experiments show that our representation is simple, compact, and propagates efficiently. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Ensemble Classification for constraint Solver Configuration

Ensemble Classification for Constraint Solver Configuration

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Kotthoff, Lars Miguel, Ian Nightingale, Peter Univ St Andrews St Andrews KY16 9AJ Fife Scotland

ISBN: (纸本)9783642153952

the automatic tuning of the parameters of algorithms and automatic selection of algorithms has received a lot of attention recently. One possible approach is the use of machine learning techniques to learn classifiers which, given the characteristics of a particular problem, make a decision as to which algorithm or what parameters to use. Little research has been done into which machine learning algorithms are suitable and the impact of picking the "right" over the "wrong" technique. this paper investigates the differences in performance of several techniques on different data sets. it furthermore provides evidence that by using a meta-technique which combines several machine learning algorithms, we can avoid the problem of having to pick the "best" one and still achieve good performance.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

A constraint-Based Encoding for Domain-Independent Temporal Planning 1

引用

24th international conference on the principles and practice of constraint programming (cp)

作者： Bit-Monnot, Arthur Univ Genoa Genoa Italy Univ Sassari Sassari Italy

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

We present a general constraint-based encoding for domain-independent task planning. Task planning is characterized by causal relationships expressed as conditions and effects of optional actions. Possible actions are typically represented by templates, where each template can be instantiated into a number of primitive actions. While most previous work for domain-independent task planning has focused on primitive actions in a state-oriented view, our encoding uses a fully lifted representation at the level of action templates. It follows a time-oriented view in the spirit of previous work in constraint-based scheduling. As a result, the proposed encoding is simple and compact as it grows with the number of actions in a solution plan rather than the number of possible primitive actions. When solved with an SMT solver, we show that the proposed encoding is slightly more efficient than state-of-the-art methods on temporally constrained planning benchmarks while clearly outperforming other fully constraint-based approaches.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

A Complete Multi-valued SAT Solver

A Complete Multi-valued SAT Solver

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Jain, Siddhartha O'Mahony, Eoin Sellmann, Meinolf Brown Univ Dept Comp Sci POB 1910 Providence RI 02912 USA Univ Coll Cork Cork Constraint Comp Ctr Cork Ireland

ISBN: (纸本)9783642153952

We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. We combine this technology with state-of-the-art cp methods for branching and introduce quantitative supports which augment the watched literal scheme with a watched domain size scheme. Most importantly, we adapt SAT nogood learning for the multi-valued case and demonstrate that exploiting the knowledge that each variable must take exactly one out of many values can lead to much stronger nogoods. Experimental results assess the benefits of these contributions and show that solving multi-valued SAT directly often works better than reducing multi-valued constraint problems to SAT.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：