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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

131 篇 会议
3 册 图书
2 篇 期刊文献

馆藏范围

136 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

118 篇 工学
- 114 篇 计算机科学与技术...
- 38 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 化学工程与技术
68 篇 理学
- 60 篇 数学
- 21 篇 系统科学
- 4 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
11 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 教育学

主题

26 篇 constraint theor...
14 篇 constraint satis...
9 篇 computer program...
8 篇 constraint progr...
6 篇 linear programmi...
4 篇 integer programm...
3 篇 target cost
3 篇 problem solving
3 篇 goal programming
3 篇 mathematical log...
3 篇 programming lang...
3 篇 artificial intel...
3 篇 logics and meani...
3 篇 scheduling
2 篇 software enginee...
2 篇 modeling languag...
2 篇 symmetry
2 篇 constrained opti...
2 篇 logic programmin...
2 篇 global constrain...

机构

3 篇 univ coll cork c...
3 篇 univ st andrews ...
3 篇 univ oxford comp...
3 篇 natl univ irelan...
3 篇 univ melbourne m...
3 篇 brown univ provi...
2 篇 univ st andrews ...
2 篇 nicta nsw
2 篇 insight centre f...
2 篇 univ genoa dibri...
2 篇 cork constraint ...
2 篇 univ coll cork d...
2 篇 univ london roya...
2 篇 imdea software i...
2 篇 aix marseille un...
2 篇 aix marseille un...
2 篇 univ coll cork c...
2 篇 faculty of elect...
2 篇 univ st andrews ...
1 篇 ligm ecole des p...

作者

6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 o'sullivan barry
5 篇 miguel ian
5 篇 van hentenryck p...
5 篇 jefferson christ...
5 篇 quesada luis
4 篇 kotthoff lars
4 篇 bessiere christi...
4 篇 de givry simon
3 篇 stuckey peter j.
3 篇 werner tomáš
3 篇 jeavons peter
3 篇 simonis helmut
3 篇 lombardi michele
3 篇 walsh toby
3 篇 dlask tomáš
3 篇 mehta deepak
2 篇 pearson justin
2 篇 solnon christine

语言

136 篇 英文

检索条件"任意字段=16th Annual International Conference on the Principles and Practice of Constraint Programming"

共 136 条记录，以下是121-130 订阅

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

详细简洁

排序：

Quantum-Accelerated Global constraint Filtering 26th

Quantum-Accelerated Global Constraint Filtering

引用

26th international conference on principles and practice of constraint programming, CP 2020

作者： Booth, Kyle E. C. O’Gorman, Bryan Marshall, Jeffrey Hadfield, Stuart Rieffel, Eleanor NASA Ames Research Center Moffett Field CA94035 United States Mountain ViewCA94043 United States University of California BerkeleyCA94720 United States

ISBN: (纸本)9783030584740

Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the alldifferent constraint and the global cardinality constraint (gcc). the subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search. © 2020, Springer Nature Switzerland AG.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of declarative models for differential cryptanalysis 27

Automatic generation of declarative models for differential ...

引用

27th international conference on principles and practice of constraint programming, CP 2021

作者： Libralesso, Luc Delobel, François Lafourcade, Pascal Solnon, Christine LIMOS CNRS UMR 6158 University Clermont Auvergne Aubière France INSA Lyon CITI INRIA CHROMA VilleurbanneF-69621 France

ISBN: (纸本)9783959772112

When designing a new symmetric block cipher, it is necessary to evaluate its robustness against differential attacks. this is done by computing Truncated Differential Characteristics (TDCs) that provide bounds on the complexity of these attacks. TDCs are often computed by using declarative approaches such as CP (constraint programming), SAT, or ILP (Integer Linear programming). However, designing accurate and efficient models for these solvers is a difficult, error-prone and time-consuming task, and it requires advanced skills on both symmetric cryptography and solvers. In this paper, we describe a tool for automatically generating these models, called Tagada (Tool for Automatic Generation of Abstraction-based Differential Attacks). the input of Tagada is an operational description of the cipher by means of black-box operators and bipartite Directed Acyclic Graphs (DAGs). Given this description, we show how to automatically generate constraints that model operator semantics, and how to generate MiniZinc models. We experimentally evaluate our approach on two different kinds of differential attacks (e.g., single-key and related-key) and four different symmetric block ciphers (e.g., the AES (Advanced Encryption Standard), Craft, Midori, and Skinny). We show that our automatically generated models are competitive with state-of-the-art approaches. these automatically generated models constitute a new benchmark composed of eight optimization problems and eight enumeration problems, with instances of increasing size in each problem. We experimentally compare CP, SAT, and ILP solvers on this new benchmark. © Luc Libralesso, François Delobel, Pascal Lafourcade, and Christine Solnon.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Using constraint programming to Generate Benzenoid Structures in theoretical Chemistry 26th

Using Constraint Programming to Generate Benzenoid Structure...

引用

26th international conference on principles and practice of constraint programming, CP 2020

作者： Carissan, Yannick Hagebaum-Reignier, Denis Prcovic, Nicolas Terrioux, Cyril Varet, Adrien Aix Marseille Univ CNRS Centrale Marseille ISM2 Marseille France Aix Marseille Univ Université de Toulon CNRS LIS Marseille France

ISBN: (纸本)9783030584740

Benzenoids are a subfamily of hydrocarbons (molecules that are only made of hydrogen and carbon atoms) whose carbon atoms form hexagons. these molecules are widely studied in theoretical chemistry and have a lot of concrete applications. therefore, generating benzenoids which have certain structural properties (e.g. having a given number of hexagons or having a particular structure from a graph viewpoint) is an interesting and important problem. It constitutes a preliminary step for studying their chemical properties. In this paper, we show that modeling this problem in Choco Solver and just letting its search engine generate the solutions is a fast enough and very flexible approach. It can allow to generate many different kinds of benzenoids with predefined structural properties by posting new constraints, saving the efforts of developing bespoke algorithmic methods for each kind of benzenoids. © 2020, Springer Nature Switzerland AG.

关键词： Structural properties

来源：评论

学校读者我要写书评

暂无评论

A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences 27

A collection of constraint programming models for the three-...

引用

27th international conference on principles and practice of constraint programming, CP 2021

作者： Cseh, Ágnes Escamocher, Guillaume Genç, Begüm Quesada, Luis Hasso-Plattner-Institute Universität Potsdam Germany Institute of Economics Centre for Economic and Regional Studies Pécs Hungary Insight Centre for Data Analytics School of Computer Science and Information Technology University College Cork Ireland

ISBN: (纸本)9783959772112

We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under diverse configurations. While several constraint models have been proposed for variants of the two-dimensional stable matching problem, we are the first to present constraint models for a higher number of dimensions. We show for all five models how to capture two different stability notions, namely weak and strong stability. Additionally, we translate some well-known fairness notions (i.e. sex-equal, minimum regret, egalitarian) into 3-dimensional matchings, and present how to capture them in each model. Our tests cover dozens of problem sizes and four different instance generation methods. We explore two levels of commitment in our models: one where we have an individual variable for each agent (individual commitment), and another one where the determination of a variable involves pairing the three agents at once (group commitment). Our experiments show that the suitability of the commitment depends on the type of stability we are dealing with. Our experiments not only led us to discover dependencies between the type of stability and the instance generation method, but also brought light to the role that learning and restarts can play in solving this kind of problems. © Ágnes Cseh, Guillaume Escamocher, Begüm Genç, and Luis Quesada.

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

Arc consistency for soft constraints 6th

引用

6th international conference on principles and practice of constraint programming, CP2000

作者： Schiex, thomas INRA Toulouse France

ISBN: (纸本)3540410538

Traditionally, local consistency is defined as a relaxation of consistency which can be checked in polynomial time. It is accompanied by a corresponding "filtering" or "enforcing" algorithm that computes in polynomial time, and from any given CSP, an equivalent unique CSP which satisfies the local consistency property. the question whether the notion of local consistency can be extended to soft constraint frameworks has been addressed by several papers, in several settings [4, 14, 12]. the main positive conclusion of these works is that the notion of local consistency can be extended to soft constraints frameworks which rely on an idempotent violation combination operator. However, the question whether this can be done for non idempotent operators as eg, in the Max-CSP problem, is not clear and has lead to several different notions of arc consistency [14, 16, 1, 11, 10]. Each of these proposals lacks several of the original properties of local consistency. In this paper, we show that using a small additional axiom, satisfied by most existing soft constraints proposals (including Max-CSP), it is possible to define a notion of arc consistency that keeps all the good properties of classical arc consistency but the unicity of the arc consistent closure. We show that this notion directly provides improved lower bounds. Stronger alternative definitions, that allow partial inconsistencies to propagate are also considered. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A Two-Phase constraint programming Model for Examination Timetabling at University College Cork 26th

A Two-Phase Constraint Programming Model for Examination Tim...

引用

26th international conference on principles and practice of constraint programming, CP 2020

作者： Genc, Begum O’Sullivan, Barry Confirm Centre for Smart Manufacturing School of Computer Science and Information Technology University College Cork Cork Ireland Insight Centre for Data Analytics School of Computer Science and Information Technology University College Cork Cork Ireland

ISBN: (纸本)9783030584740

Examination timetabling is a widely studied NP-hard problem. An additional challenge to the complexity of the problem are many real-world requirements that can often prevent the relaxation of some constraints. We report on a project focused on automating the examination timetabling process of University College Cork (UCC) to enhance the examination schedules so that they are fairer to student, as well as being less resource intensive to generate from an administrative point of view. We work with a formulation developed in collaboration with the institution and real data that it provided to us. We propose a two-phase constraint programming approach to solving UCC ’s examination timetabling problem. the first phase considers the timing of examinations while the second phase considers their allocation to rooms. Both phases are modelled using bin-packing constraints and, in particular, an interesting variant in which items can be split across multiple bins. this variant is known as bin packing with fragmentable items. We investigate the tightly linked constraints and difficulties in decomposing the centralised model. We provide empirical results using different search strategies, and compare the quality of our solution with the existing UCC schedule. constraint programming allows us to easily modify the model to express additional constraints or remove the pre-existing ones. Our approach generates significantly better timetables for the university, as measured using a variety of real-world quality metrics, than those prepared by their timetabling experts, and in a reasonable timeframe. © 2020, Springer Nature Switzerland AG.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Research on Target Cost Control of Construction Project based on Goal programming

Research on Target Cost Control of Construction Project base...

引用

2009 IEEE 16th international conference on Industrial Engineering and Engineering Management(IEEE第16届工业工程与工程管理国际学术会议)

作者： H.Zhao G.He School of Management Shenyang University of TechnologyShenyangP.R.China

ISBN: (纸本)9781424436712

Target cost control of construction projects is an important part of project management,and it plays a crucial role on the benefit of construction projects. In this paper,the issue about target cost control on the early stage of construction projects has been explored further. Firstly,this paper elaborates on determination principles and measurement methods of target cost of construction projects. secondly,through the establishment of target cost programming model of construction projects and the use of simplex method on the linear programming,the established target cost programming model has been solved and the satisfied value of target cost control of construction projects has been determined based on final solution of the model. Finally,the application of method has been verified in practice. the purpose on target cost control of construction project has been achieved qualitatively and quantitatively. the effective control about target cost of construction projects on the early stage has been ensured.

关键词： Target cost goal programming simplez method

来源：评论

学校读者我要写书评

暂无评论

A time-space trade-off for constraint networks decomposition

A time-space trade-off for constraint networks decomposition

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： P. Jegou C. Terrioux LSIS Université Aix Marseille 3 Marseilles France

We study here a CSP decomposition method introduced in [P. Jegou (1990)] and called cyclic-clustering. While [P. Jegou (1990)] only presents the principles of the method, this work explains how this method can be made operational by exploiting good properties have triangulated induced subgraphs. After, we give formal results, which show that cyclic-clustering proposes a time-space trade-off w.r.t. theoretical complexities. Finally, we present some preliminary experiments, which show that cyclic-clustering may be efficient in practice.

关键词： Large scale integration NP-complete problem Tree graphs Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Exploiting multidirectionality in coarse-grained arc consistency algorithms

引用

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

作者： Lecoutre, Christophe Boussemart, Frédéric Hemery, Fred CNRS FRE 2499 Rue de l’université SP 16 Lens cedex62307 France

ISBN: (纸本)3540202021

Arc consistency plays a central role in solving constraint Satisfaction Problems. this is the reason why many algorithms have been proposed to establish it. Recently, an algorithm called AC2001 and AC3.1 has been independently presented by their authors. this algorithm which is considered as a refinement of the basic algorithm AC3 has the advantage of being simple and competitive. However, it does not take into account constraint bidirectionality as AC7 does. In this paper, we address this issue, and, in particular, introduce two new algorithms called AC3.2 and AC3.3 which benefit from good properties of both AC3 and AC7. Indeed, AC3.2 and AC3.3 are as easy to implement as AC3 and take advantage of bidirectionality as AC7 does. More precisely, AC3.2 is a general algorithm which partially exploits bidirectionality whereas AC3.3 is a binary algorithm which fully exploits bidirectionality. It turns out that, when Maintaining Arc Consistency during search, MAC3.2, due to a memorization effect, is more efficient than MAC3.3 both in terms of constraint checks and cpu time. Compared to MAC2001/3.1, our experimental results show that MAC3.2 saves about 50% of constraint checks and, on average, 15% of cpu time. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：