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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

102 篇 会议
6 篇 期刊文献
4 册 图书

馆藏范围

111 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

103 篇 工学
- 101 篇 计算机科学与技术...
- 53 篇 软件工程
- 4 篇 信息与通信工程
- 2 篇 电气工程
- 1 篇 力学（可授工学、理...
- 1 篇 化学工程与技术
- 1 篇 农业工程
66 篇 理学
- 62 篇 数学
- 13 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 农学
- 1 篇 作物学

主题

20 篇 constraint theor...
17 篇 constraint satis...
13 篇 constraint progr...
7 篇 constrained opti...
3 篇 problem solving
3 篇 mathematical log...
2 篇 constraint proce...
2 篇 runtime distribu...
2 篇 dpll-based searc...
2 篇 trees (mathemati...
2 篇 well-founded ope...
2 篇 polynomial appro...
2 篇 constraint answe...
2 篇 iterative method...
2 篇 optimization
2 篇 hybrid mknf
2 篇 constraint logic...
2 篇 pattern unificat...
2 篇 theory solving
2 篇 knowledge compil...

机构

3 篇 new mexico state...
2 篇 univ sci & techn...
2 篇 univ london roya...
2 篇 univ utrecht dep...
2 篇 univ potsdam pot...
2 篇 aalto univ aalto
2 篇 quantek bologna
2 篇 inria rennes ren...
2 篇 univ melbourne m...
2 篇 natl univ irelan...
2 篇 univ connecticut...
2 篇 univ nebraska co...
2 篇 ferrara univ dep...
2 篇 shanghai univ sc...
2 篇 univ alberta dep...
1 篇 ligm ecole des p...
1 篇 inra toulouse
1 篇 japan sci & tech...
1 篇 univ politecn ca...
1 篇 petalmd quebec c...

作者

5 篇 stuckey peter j.
4 篇 terrioux cyril
4 篇 michel laurent
4 篇 schaus pierre
4 篇 ndiaye samba ndo...
4 篇 o'sullivan barry
3 篇 solnon christine
3 篇 miguel ian
3 篇 van hentenryck p...
3 篇 bessiere christi...
3 篇 jegou philippe
2 篇 pearson justin
2 篇 kaminski roland
2 篇 gavanelli marco
2 篇 prosser patrick
2 篇 schneider anthon...
2 篇 goldsztejn alexa...
2 篇 ostrowski max
2 篇 schellhorn sebas...
2 篇 peano andrea

语言

111 篇 英文
1 篇 中文

检索条件"任意字段=20th International Conference on the Principles and Practice of Constraint Programming, CP 2014"

共 112 条记录，以下是91-100 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Automatically improving constraint models in savile row through associative-commutative common subexpression elimination

Automatically improving constraint models in savile row thro...

引用

20th international conference on the principles and practice of constraint programming, cp 2014

作者： Nightingale, Peter Akgün, Özgür Gent, Ian P. Jefferson, Christopher Miguel, Ian School of Computer Science University of St. Andrews St.-Andrews Fife-KY16 9SX United Kingdom

ISBN: (纸本)9783319104270

When solving a problem using constraint programming, constraint modelling is widely acknowledged as an important and difficult task. Even a constraint modelling expert may explore many models and spend considerable time modelling a single problem. therefore any automated assistance in the area of constraint modelling is valuable. Common sub-expression elimination (CSE) is a type of constraint reformulation that has proved to be useful on a range of problems. In this paper we demonstrate the value of an extension of CSE called Associative-Commutative CSE (AC-CSE). this technique exploits the properties of associativity and commutativity of binary operators, for example in sum constraints. We present a new algorithm, X-CSE, that is able to choose from a larger palette of common subexpressions than previous approaches. We demonstrate substantial gains in performance using X-CSE. For example on BIBD we observed speed increases of more than 20 times compared to a standard model and that using X-CSE outperforms a sophisticated model from the literature. For Killer Sudoku we found that X-CSE can render some apparently difficult instances almost trivial to solve, and we observe speed increases up to 350 times. For BIBD and Killer Sudoku the common subexpressions are not present in the initial model: an important part of our methodology is reformulations at the preprocessing stage, to create the common subexpressions for X-CSE to exploit. In summary we show that X-CSE, combined with preprocessing and other reformulations, is a powerful technique for automated modelling of problems containing associative and commutative constraints. © 2014 Springer international Publishing Switzerland.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Quantified Valued constraint Satisfaction Problem 1

引用

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

作者： Madelaine, Florent Secouard, Stephane Univ Paris Est Creteil LACL Creteil France Univ Caen Normandie CNRS GREYC Caen France

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

We study the complexity of the quantified and valued extension of the constraint satisfaction problem (QVCSP) for certain classes of languages. this problem is also known as the weighted constraint satisfaction problem with min-max quantifiers [1]. the multimorphisms that preserve a language is the starting point of our analysis. We establish some situations where a QVCSP is solvable in polynomial time by formulating new algorithms or by extending the usage of collapsibility, a property well known for reducing the complexity of the quantified CSP (QCSP) from Pspace to NP. In contrast, we identify some classes of problems for which the VCSP is tractable but the QVCSP is Pspace-hard. As a main Corollary, we derive an analogue of Shaeffer's dichotomy between P and Pspace for QCSP on Boolean languages and Cohen et al. dichotomy between P and NP-complete for VCSP on Boolean valued languages: we prove that the QVCSP follows a dichotomy between P and Pspace-complete. Finally, we exhibit examples of NP-complete QVCSP for domains of size 3 and more, which suggest at best a trichotomy between P, NP-complete and Pspace-complete for the QVCSP.

关键词： Complexity classification Valued CSP Quantified CSP Polymorphisms Multimorphisms Collapsibility

来源：评论

学校读者我要写书评

暂无评论

Computing and exploiting tree-decompositions for solving constraint networks

引用

11th international conference on principles and practice of constraint programming - cp 2005

作者： Jégou, Philippe Ndiaye, Samba Ndojh Terrioux, Cyril Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20 France

ISBN: (纸本)3540292381

Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real practical interest yet. In this paper, we study several methods for computing a rough optimal tree-decomposition and assess their relevance for solving CSPs. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Labelling heuristics for CSP application domains 7

引用

7th international conference on principles and practice of constraint programming, cp 2001

作者： Kızıltan, Zeynep Computer Science Division Department of Information Science Uppsala University Box 513 UppsalaS–751 20 Sweden

ISBN: (纸本)3540428631

Many real-life problems are constraint satisfaction problems (CSPs), which can be programmed as constraint models and then be solved using constraint solvers. constraint solvers are equipped with a search algorithm, such as forward checking, and labelling heuristics, one of which is the default. To enhance the performance of constraint models, a lot of research has been made in recent years to develop new labelling heuristics, which concern the choice of the next variable to branch on during the search and the choice of the value to be assigned to that variable. these heuristics significantly reduce the search space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scheduling for cellular manufacturing

Scheduling for cellular manufacturing

引用

13th international conference on principles and practice of constraint programming (cp 2007)

作者： van der Krogt, Roman Little, James Pulliam, Kenneth Hanhilammi, Sue Jin, Yue Univ Coll Cork Dept Comp Sci Cork Constraint Computat Ctr Cork Ireland Alcatel Lucent Syst Integrat Ctr Columbus OH USA Bell Labs Res Ctr Dublin Ireland

ISBN: (纸本)9783540749691

Alcatel-Lucent is a major player in the field of telecommunications. One of the products it offers to network operators is wireless infrastructure such as base stations. Such equipment is delivered in cabinets. these cabinets are packed with various pieces of electronics: filters, amplifiers, circuit packs, etc. the exact configuration of a cabinet is dependent upon the circumstances it is being placed in, and some 20 product groups can be distinguished. However, the variation in cabinets is large, even within one product group. For this reason, they are built to order. In order to improve cost, yield and delivery performance, lean manufacturing concepts were applied to change the layout of the factory to one based on cells. these cells focus on improving manufacturing through standardised work, limited changeovers between product groups and better utilisation of test equipment. A key component in the implementation of these improvements is a system which schedules the cells to satisfy customer request dates in an efficient sequence. this paper describes the transformation and the tool that was built to support the new method of operations. the implementation has achieved significant improvements in manufacturing interval, work in process inventory, first test yield, headcount, quality (i.e. fewer defects are found during the testing stage) and delivery performance. Although these benefits are mainly achieved because of the change to a cell layout, the scheduling tool is crucial in realising the full potential of it.

关键词： Cellular manufacturing

来源：评论

学校读者我要写书评

暂无评论

Resolution complexity of random constraints 8th

引用

8th international conference on principles and practice of constraint programming, cp 2002

作者： Mitchell, David G. Simon Fraser University Burnaby Canada

ISBN: (纸本)3540441204

Random instances are widely used as benchmarks in evaluating algorithms for finite-domain constraint satisfaction problems (CSPs).We present an analysis that shows why deciding satisfiability of instances from some distributions is challenging for current complete methods. Fora typical random CSP model, we show that when constraints are not too tight almost all unsatisfiable instances have a structural property which guarantees that unsatisfiability proofs in a certain resolution-like system must be of exponential size. this proof system can efficiently simulate the reasoning of a large class of CSP algorithms which will thus have exponential running time on these instances. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Tractable combinations of global constraints

Tractable combinations of global constraints

引用

19th international conference on principles and practice of constraint programming, cp 2013

作者： Cohen, David A. Jeavons, Peter G. thorstensen, Evgenij Živný, Stanislav Department of Computer Science Royal Holloway University of London United Kingdom Department of Computer Science University of Oxford United Kingdom Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9783642406263

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structural restrictions with the observation that some important types of global constraint do not distinguish between large classes of equivalent solutions. © 2013 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

constraint-based problem decomposition for a key configuration problem 4th

Constraint-based problem decomposition for a key configurati...

引用

4th international conference on principles and practice of constraint programming, cp 1998

作者： Junker, Ulrich ILOG 9 rue de Verdun BP 85 Gentilly CedexF-94253 France

ISBN: (纸本)3540652248

Finding good problem decompositions is crucial for solving large-scale key/lock configuration problems. We present a novel approach to problem decomposition where the detection of a subproblem hierarchy is formulated as a constraint satisfaction problem (CSP) on set variables. Primitive constraints on set variables such as an inverse and a union-over- set-constraint are used to formalize properties of trees and to ensure that solutions of these CSPs represent a tree. An objective for optimizing properties of the tree is presented as well. Experimental results from an industrial prototype are reported. © Springer-Verlag Berlin Heidelberg 1998.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming - cp 2009 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Ian P. Gent

ISBN: (数字)9783642042447

ISBN: (纸本)9783642042430

this volume contains the papers presented at cp 2009: the 15th international conference on principles and practice of constraint programming. It was held from September 20–24, 2009 at the Rectory of the New University of Lisbon, Portugal. Everyone involved with the conference thanks our sponsors for their support. there were 128 submissions to the research track, of which 53 were accepted for a rate of 41.4%. Each submission was reviewed by three reviewers, with a small number of additional reviews obtained in exceptional cases. Each review waseitherbyaProgrammeCommitteemember,orbyacolleagueinvitedtohelp by a committee member thanks to their particular expertise. Papers submitted as long papers were accepted at full length or not at all. It is important to note that papers submitted as short papers were held to the same high standards of qualityas long papers. there is thus no distinction in these proceedings between long and short papers, except of course the number of pages they occupy. As it happens, the acceptancerates of short and long papers wereverysimilar indeed. therewere13submissionstotheapplicationtrack,ofwhich8wereaccepted, fora rateof61.5%.Papersunderwentthe samereviewprocessasregularpapers, and there was not a separate committee for reviewing application track papers. However, papers in the application track were not required to be original or novel research, but to be original and novel as an application of constraints.

关键词： programming Techniques Software Engineering programming Languages, Compilers, Interpreters Computational Science and Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for mining frequent sequence with constraint programming 15th

引用

15th European conference on Machine Learning and principles and practice of Knowledge Discovery in Databases, ECML PKDD 2016

作者： Aoga, John O. R. Guns, Tias Schaus, Pierre UCLouvain ICTEAM Louvain-la-Neuve Belgium DTAI Research Group KU Leuven Leuven Belgium

ISBN: (纸本)9783319462264

the main advantage of constraint programming (cp) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular expressions, length restrictions, etc.). the current best cp approach for SPM uses a global constraint (module) that computes the projected database and enforces the minimum frequency;it does this with a filtering algorithm similar to the PrefixSpan method. However, the resulting system is not as scalable as some of the most advanced mining systems like Zaki’s cSPADE. We show how, using techniques from both data mining and cp, one can use a generic constraint solver and yet outperform existing specialized systems. this is mainly due to two improvements in the module that computes the projected frequencies: first, computing the projected database can be sped up by pre-computing the positions at which a symbol can become unsupported by a sequence, thereby avoiding to scan the full sequence each time;and second by taking inspiration from the trailing used in cp solvers to devise a backtracking-aware data structure that allows fast incremental storing and restoring of the projected database. Detailed experiments show how this approach outperforms existing cp as well as specialized systems for SPM, and that the gain in efficiency translates directly into increased efficiency for other settings such as mining with regular expressions. the data and software related to this paper are available at http://***/cp4dm/ spm/. © Springer international Publishing AG 2016.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共12页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：