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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

49 篇 会议
2 册 图书

馆藏范围

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

日期分布

学科分类号

43 篇 工学
- 43 篇 计算机科学与技术...
- 36 篇 软件工程
- 2 篇 材料科学与工程（可...
- 2 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
36 篇 理学
- 26 篇 系统科学
- 21 篇 数学
- 4 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
4 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 工商管理
2 篇 法学
- 2 篇 社会学

主题

10 篇 constraint theor...
7 篇 constraint satis...
4 篇 constraint progr...
2 篇 modeling languag...
2 篇 model checking
2 篇 linear programmi...
2 篇 constraint progr...
1 篇 constraint logic...
1 篇 structural prope...
1 篇 international
1 篇 reinforcement le...
1 篇 bounded model ch...
1 篇 probability dist...
1 篇 soft neighborhoo...
1 篇 test case genera...
1 篇 redundancy
1 篇 embedded systems
1 篇 computational ge...
1 篇 iterative method...
1 篇 conference,

机构

2 篇 dtai ku leuven
2 篇 lund university ...
2 篇 university of ed...
2 篇 aix marseille un...
2 篇 aix marseille un...
2 篇 monash universit...
2 篇 faculty of elect...
2 篇 ku leuven
2 篇 university of co...
1 篇 tech univ madrid...
1 篇 computer and aut...
1 篇 university of co...
1 篇 algorithms and c...
1 篇 pontificia univ ...
1 篇 univ pisa pisa
1 篇 visualization la...
1 篇 univ bologna bol...
1 篇 nicta unsw
1 篇 aniti irit unive...
1 篇 cnrs lirmm unive...

作者

4 篇 stuckey peter j.
4 篇 guns tias
3 篇 devriendt jo
2 篇 prcovic nicolas
2 篇 terrioux cyril
2 篇 werner tomáš
2 篇 akgün özgür
2 篇 hagebaum-reignie...
2 篇 michel laurent
2 篇 varet adrien
2 篇 gange graeme
2 篇 walsh toby
2 篇 tsouros dimosthe...
2 篇 dlask tomáš
2 篇 carissan yannick
2 篇 tsouros dimos
1 篇 pearson justin
1 篇 davidson ewan
1 篇 solnon christine
1 篇 briot nicolas

语言

50 篇 英文
1 篇 中文

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

共 51 条记录，以下是11-20 订阅

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

详细简洁

排序：

abstractXOR: A global constraint dedicated to differential cryptanalysis 26th

abstractXOR: A global constraint dedicated to differential c...

引用

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

作者： Rouquette, Loïc Solnon, Christine CITI INRIA INSA Lyon Villeurbanne69621 France LIRIS UMR5201 CNRS Villeurbanne69621 France

ISBN: (纸本)9783030584740

constraint programming models have been recently proposed to solve cryptanalysis problems for symmetric block ciphers such as AES. these models are more efficient than dedicated approaches but their design is difficult: straightforward models do not scale well and it is necessary to add advanced constraints derived from cryptographic properties. We introduce a global constraint which simplifies the modelling step and improves efficiency. We study its complexity, introduce propagators and experimentally evaluate them on two cryptanalysis problems (single-key and related-key) for two block ciphers (AES and Midori). © 2020, Springer Nature Switzerland AG.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

constraint programming-Based Job Dispatching for Modern HPC Applications 25th

Constraint Programming-Based Job Dispatching for Modern HPC ...

引用

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

作者： Galleguillos, Cristian Kiziltan, Zeynep Sirbu, Alina Babaoglu, Ozalp Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Bologna Bologna Italy Univ Pisa Pisa Italy

ISBN: (纸本)9783030300487

HPC systems are increasingly being used for big data analytics and predictive model building that employ many short jobs. In these application scenarios, HPC job dispatchers need to process large numbers of short jobs quickly and make decisions on-line while ensuring high Quality-of-Service (QoS) levels and meet demanding timing requirements. constraint programming (cp) is an effective approach for tackling job dispatching problems. Yet, the state-of-the-art cp-based job dispatchers are unable to satisfy the challenges of on-line dispatching and take advantage of job duration predictions. these limitations jeopardize achieving high QoS levels, and consequently impede the adoption of cp-based dispatchers in HPC systems. We propose a class of cp-based dispatchers that are more suitable for HPC systems running modern applications. the new dispatchers are able to reduce the time required for generating on-line dispatching decisions significantly, and are able to make effective use of job duration predictions to decrease waiting times and job slowdowns, especially for workloads dominated by short jobs.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

From Model-Checking to Temporal Logic constraint Solving

From Model-Checking to Temporal Logic Constraint Solving

引用

15th international conference on principles and practice of constraint programming (cp 2009)

作者： Fages, Francois Rizk, Aurelien INRIA Paris Rocquencourt EPI Contraintes F-78153 Le Chesnay France

ISBN: (纸本)9783642042430

In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some domain D, and by computing a validity domain for the variables rather than a truth value for the formula. this allows us to define a continuous degree of satisfaction for a temporal logic formula ill a, given structure, opening up the field of model-checking to optimization. We illustrate this approach with reverse engineering problems coming from systems biology, and provide some performance figures oil parameter optimization problems with respect to temporal logic specifications.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Ensuring a relevant visiting order of the leaf nodes during a tree search 5th

引用

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

作者： Prcovic, N Neveu, B CERMICS F-06902 Sophia Antipolis France

ISBN: (纸本)3540666265

We define a model for heuristic tree search which assumes that the quality of the heuristic used for ordering the successors of a node improves as depth increases. We show that a usual value ordering heuristic for solving constraint satisfaction problems fits to this model. Our model defines a partial order on the leaf nodes of the search tree, according to their probability to be a solution. We check which search strategies among interleaved depth-first search (IDFS), limited discrepancy search (LDS) and depth-bounded discrepancy search (DDS) visit the leaf nodes while respecting the partial order. Our study leads to conclude that, among these strategies, only Pure IDFS and a slight modification of improved LDS respect it.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

constraint reasoning over strings

引用

9th international conference on principles and practice of constraint programming

作者： Golden, K Pang, WL NASA Ames Res Ctr Computat Sci Div Moffett Field CA 94035 USA NASA Ames Res Ctr QSS Grp Inc Moffett Field CA 94035 USA

this paper discusses an approach to representing and reasoning about constraints over strings. We discuss how string domains can often be concisely represented using regular languages, and how constraints over strings... 详细信息

ISBN: (纸本)3540202021

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Connecting ABT with Arc Consistency

引用

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

作者： Brito, Ismel Meseguer, Pedro CSIC IIIA Bellaterra 09193 Spain

ISBN: (纸本)9783540859574

ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogoods has an empty left-hand side, the considered value is eliminated unconditionally, once and for all. this value deletion can be propagated using standard arc consistency techniques, producing new deletions in the domains of other variables. this causes substantial reductions in the search effort required to solve a class of problems. We also extend this idea to the propagation of conditional deletions. something already proposed in the past. We provide experimental results that show the benefits of the proposed approach, especially considering communication cost.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Bounding Linear Programs by constraint Propagation: Application to Max-SAT 26th

Bounding Linear Programs by Constraint Propagation: Applicat...

引用

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

作者： Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic

ISBN: (纸本)9783030584740

the Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this technique by replacing arc consistency with a (problem-dependent) constraint propagation in a system of linear inequalities over the reals. When propagation detects infeasibility, the infeasibility certificate (a solution to the alternative system in Farkas’ lemma) provides a dual improving direction. We illustrate this approach on the LP relaxation of Weighted Max-SAT. We show in experiments that the obtained bounds are often not far from global LP optima and we prove that they are exact for known tractable subclasses of Weighted Max-SAT. © 2020, Springer Nature Switzerland AG.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

On Relation Between constraint Propagation and Block-Coordinate Descent in Linear Programs 26th

On Relation Between Constraint Propagation and Block-Coordin...

引用

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

作者： Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic

ISBN: (纸本)9783030584740

Block-coordinate descent (BCD) is a popular method in large-scale optimization. Unfortunately, its fixed points are not global optima even for convex problems. A succinct characterization of convex problems optimally solvable by BCD is unknown. Focusing on linear programs, we show that BCD fixed points are identical to fixed points of another method, which uses constraint propagation to detect infeasibility of a system of linear inequalities in a primal-dual loop (a special case of this method is the Virtual Arc Consistency algorithm by Cooper et al.). this implies that BCD fixed points are global optima iff a certain propagation rule decides feasibility of a certain class of systems of linear inequalities. © 2020, Springer Nature Switzerland AG.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Computing the Local Aromaticity of Benzenoids thanks to constraint programming 26th

Computing the Local Aromaticity of Benzenoids Thanks to Con...

引用

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

作者： Carissan, Yannick Dim, Chisom-Adaobi 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. then, there is a lot of problems relative to this subject, like the benzenoid generation or the enumeration of all its Kekulé structures (i.e. all valid configurations of double bonds). In this context, the computation of the local aromaticity of a given benzenoid is an important problematic since the aromaticity cannot be measured. Nowadays, computing aromaticity requires quantum chemistry calculations that are too expensive to be used on medium to large-sized molecules. But, there exist some methods related to graph theory which can allow us to compute it. In this article, we describe how constraint programming can be useful in order to compute the aromaticity of benzenoids. Moreover we show that our method is much faster than the reference one, namely NICS. © 2020, Springer Nature Switzerland AG.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Generating Random Logic Programs Using constraint programming 26th

Generating Random Logic Programs Using Constraint Programmin...

引用

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

作者： Dilkas, Paulius Belle, Vaishak University of Edinburgh Edinburgh United Kingdom Alan Turing Institute London United Kingdom

ISBN: (纸本)9783030584740

Testing algorithms across a wide range of problem instances is crucial to ensure the validity of any claim about one algorithm’s superiority over another. However, when it comes to inference algorithms for probabilistic logic programs, experimental evaluations are limited to only a few programs. Existing methods to generate random logic programs are limited to propositional programs and often impose stringent syntactic restrictions. We present a novel approach to generating random logic programs and random probabilistic logic programs using constraint programming, introducing a new constraint to control the independence structure of the underlying probability distribution. We also provide a combinatorial argument for the correctness of the model, show how the model scales with parameter values, and use the model to compare probabilistic inference algorithms across a range of synthetic problems. Our model allows inference algorithm developers to evaluate and compare the algorithms across a wide range of instances, providing a detailed picture of their (comparative) strengths and weaknesses. © 2020, Springer Nature Switzerland AG.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：