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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Leveraging Reinforcement Learning, constraint programming and Local Search: A Case Study in Car Manufacturing 26th

Leveraging Reinforcement Learning, Constraint Programming an...

引用

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

作者： Antuori, Valentin Hebrard, Emmanuel Huguet, Marie-José Essodaigui, Siham Nguyen, Alain LAAS-CNRS Université de Toulouse CNRS INSA Toulouse France Renault Boulogne-Billancourt France ANITI Université de Toulouse Toulouse France

ISBN: (纸本)9783030584740

the problem of transporting vehicle components in a car manufacturer workshop can be seen as a large scale single vehicle pickup and delivery problem with periodic time windows. Our experimental evaluation indicates that a relatively simple constraint model shows some promise and in particular outperforms the local search method currently employed at Renault on industrial data over long time horizon. Interestingly, with an adequate heuristic, constraint propagation is often sufficient to guide the solver toward a solution in a few backtracks on these instances. We therefore propose to learn efficient heuristic policies via reinforcement learning and to leverage this technique in several approaches: rapid-restarts, limited discrepancy search and multi-start local search. Our methods outperform both the current local search approach and the classical cp models on industrial instances as well as on synthetic data. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Distributed constraint-based local search

Distributed constraint-based local search

引用

12th international conference on principles and practice of constraint programming (cp 2006)

作者： Michel, Laurent See, Andrew Van Hentenryck, Pascal Univ Connecticut Storrs CT 06269 USA Brown Univ Providence RI 02912 USA

ISBN: (纸本)3540462678

Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed but instead a doubling of the number of cores. Unfortunately, it also places significant conceptual and implementation burden on programmers. this paper aims at addressing this challenge for constraint-based local search (CBLS), whose search procedures typically exhibit inherent parallelism stemming from multistart, restart, or population-based techniques whose benefits have been demonstrated both experimentally and theoretically. the,paper presents abstractions that allows distributed CBLS programs to be close to their sequential and parallel counterparts, keeping the conceptual and implementation overhead of distributed computing minimal. A preliminary implementation in COMET exhibits significant speed-ups in constraint satisfaction and optimization applications. the implementation also scales well with the number of machines. Of particular interest is the observation that generic abstractions of CBLS and cp, such as models and solutions, and advanced control structures such as events and closures, play a fundamental role to keep the distance between sequential and distributed CBLS programs small. As a result, the abstractions directly apply to cp programs using multistarts or restarts procedures.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Breaking Symmetries with RootClique and LexTopSort 26th

Breaking Symmetries with RootClique and LexTopSort

引用

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

作者： Fichte, Johannes K. Hecher, Markus Szeider, Stefan School of Engineering Sciences TU Dresden Dresden Germany Database and Artificial Intelligence Group TU Wien Vienna Austria Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783030584740

Bounded fractional hypertree width is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Fichte et al. (cp 2018) presented a robust and scalable method for finding optimal fractional hypertree decompositions, based on an encoding to SAT Modulo theory (SMT). In this paper, we provide an in-depth study of two powerful symmetry breaking predicates that allow us to further speed up the SMT-based decomposition: RootClique fixes the root of the decomposition tree;LexTopSort fixes the elimination ordering with respect to an underlying DAG. We perform an extensive empirical evaluation of both symmetry-breaking predicates with respect to the primal graph (which is known in advance) and the induced graph (which is generated during the search). © 2020, Springer Nature Switzerland AG.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：