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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是21-30 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Omissions in constraint Acquisition 26th

Omissions in Constraint Acquisition

引用

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

作者： Tsouros, Dimosthenis C. Stergiou, Kostas Bessiere, Christian Department of Electrical and Computer Engineering University of Western Macedonia Kozani Greece CNRS University of Montpellier Montpellier France

ISBN: (纸本)9783030584740

Interactive constraint acquisition is a special case of query-directed learning, also known as "exact" learning. It is used to assist non-expert users in modeling a constraint problem automatically by posting examples to the user that have to be classified as solutions or non-solutions. One significant issue that has not been addressed in the literature of constraint acquisition is the possible presence of uncertainty in the answers of the users. We address this by introducing Limited Membership Queries, where the user has the option of replying "I don’t know", corresponding to "omissions" in exact learning. We present two algorithms for handling omissions. the first one deals with omissions that are independent events, while the second assumes that omissions are related to gaps in the user’s knowledge. We present theoretical results about both methods and we evaluate them on benchmark problems. Importantly, our second algorithm can not only learn (a part of) the target network, but also the constraints that cause the user’s uncertainty. © 2020, Springer Nature Switzerland AG.

关键词： Mergers and acquisitions

来源：评论

学校读者我要写书评

暂无评论

Watched Propagation of$$0$$ -$$1$$ Integer Linear constraints 26th

Watched Propagation of$$0$$ -$$1$$ Integer Linear Constraint...

引用

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

作者： Devriendt, Jo Lund University Lund Sweden University of Copenhagen Copenhagen Denmark

ISBN: (纸本)9783030584740

Efficient unit propagation for clausal constraints is a core building block of conflict-driven clause learning (CDCL) Boolean satisfiability (SAT) and lazy clause generation constraint programming (cp) solvers. Conflict-driven pseudo-Boolean (PB) solvers extend the CDCL paradigm from clausal constraints to integer linear constraints, also known as (linear) PB constraints. For PB solvers, many different propagation techniques have been proposed, including a counter technique which watches all literals of a PB constraint. While CDCL solvers have moved away from counter propagation and have converged on a two watched literals scheme, PB solvers often simultaneously implement different propagation algorithms, including the counter one. the question whether watched propagation for PB constraints is more efficient than counter propagation, is still open. Watched propagation is inherently more complex for PB constraints than for clauses, and several sensible variations on the idea exist. We propose a new variant of watched propagation for PB constraints and provide extensive experimental results to verify its effectiveness. these results indicate that our watched propagation algorithm is superior to counter propagation, but when paired with specialized propagation algorithms for clauses and cardinality constraints, the difference is fairly small. © 2020, Springer Nature Switzerland AG.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models 26th

Theoretical and Experimental Results for Planning with Learn...

引用

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

作者： Say, Buser Devriendt, Jo Nordström, Jakob Stuckey, Peter J. Monash University Melbourne Australia Lund University Lund Sweden University of Copenhagen Copenhagen Denmark

ISBN: (纸本)9783030584740

We study planning problems where the transition function is described by a learned binarized neural network (BNN). theoretically, we show that feasible planning with a learned BNN model is NP-complete, and present two new constraint programming models of this task as a mathematical optimization problem. Experimentally, we run solvers for constraint programming, weighted partial maximum satisfiability, 0–1 integer programming, and pseudo-Boolean optimization, and observe that the pseudo-Boolean solver outperforms previous approaches by one to two orders of magnitude. We also investigate symmetry handling for planning problems with learned BNNs over long horizons. While the results here are less clear-cut, we see that exploiting symmetries can sometimes reduce the running time of the pseudo-Boolean solver by up to three orders of magnitude. © 2020, Springer Nature Switzerland AG.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

HADDOCK: A Language and Architecture for Decision Diagram Compilation 26th

HADDOCK: A Language and Architecture for Decision Diagram C...

引用

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

作者： Gentzel, Rebecca Michel, Laurent van Hoeve, W.-J. University of Connecticut StorrsCT06269 United States Carnegie Mellon University PittsburghPA15213 United States

ISBN: (纸本)9783030584740

Multi-valued decision diagrams (MDDs) were introduced into constraint programming over a decade ago as a powerful alternative to domain propagation. While effective MDD-propagation algorithms have been proposed for various constraints, to date no system exists that can generically compile and combine MDD propagation for arbitrary constraints. To fill this need, we introduce Haddock, a declarative language and architecture for MDD compilation. Haddock supports the specification, implementation, and composition of a broad range of MDD propagators that delivers the strength one expects from MDDs at a fraction of the development effort and with comparable performance. this paper describes the language, the framework architecture, outlines its performance credentials and demonstrates how to specify and implement novel MDD propagators. © 2020, Springer Nature Switzerland AG.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Perturbing Branching Heuristics in constraint Solving 26th

Perturbing Branching Heuristics in Constraint Solving

引用

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

作者： Paparrizou, Anastasia Wattez, Hugues CRIL University of Artois & CNRS Lens France

ISBN: (纸本)9783030584740

Variable ordering heuristics are one of the key settings for an efficient constraint solver. During the last two decades, a considerable effort has been spent for designing dynamic heuristics that iteratively change the order of variables as search progresses. At the same time, restart and randomization methods have been devised for alleviating heavy-tailed phenomena that typically arise in backtrack search. Despite restart methods are now well-understood, choosing how and when to randomize a given heuristic remains an open issue in the design of modern solvers. In this paper, we present several conceptually simple perturbation strategies for incorporating random choices in constraint solving with restarts. the amount of perturbation is controlled and learned in a bandit-driven framework under various stationary and non-stationary exploration policies, during successive restarts. Our experimental evaluation shows significant performance improvements for the perturbed heuristics compared to their classic counterpart, establishing the need for incorporating perturbation in modern constraint solvers. © 2020, Springer Nature Switzerland AG.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Effective Encodings of constraint programming Models to SMT 26th

Effective Encodings of Constraint Programming Models to SMT

引用

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

作者： Davidson, Ewan Akgün, Özgür Espasa, Joan Nightingale, Peter School of Computer Science University of St Andrews St Andrews United Kingdom Department of Computer Science University of York York United Kingdom

ISBN: (纸本)9783030584740

Satisfiability Modulo theories (SMT) is a well-established methodology that generalises propositional satisfiability (SAT) by adding support for a variety of theories such as integer arithmetic and bit-vector operations. SMT solvers have made rapid progress in recent years. In part, the efficiency of modern SMT solvers derives from the use of specialised decision procedures for each theory. In this paper we explore how the Essence Prime constraint modelling language can be translated to the standard SMT-LIB language. We target four theories: bit-vectors (QF_BV), linear integer arithmetic (QF_LIA), non-linear integer arithmetic (QF_NIA), and integer difference logic (QF_IDL). the encodings are implemented in the constraint modelling tool Savile Row. In an extensive set of experiments, we compare our encodings for the four theories, showing some notable differences and complementary strengths. We also compare our new encodings to the existing work targeting SMT and SAT, and to a well-established learning cp solver. Our two proposed encodings targeting the theory of bit-vectors (QF_BV) both substantially outperform earlier work on encoding to QF_BV on a large and diverse set of problem classes. © 2020, Springer Nature Switzerland AG.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：