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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

34 篇 会议
3 册 图书

馆藏范围

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

日期分布

学科分类号

27 篇 理学
- 21 篇 数学
- 20 篇 系统科学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...
24 篇 工学
- 23 篇 计算机科学与技术...
- 20 篇 软件工程
- 1 篇 力学（可授工学、理...
6 篇 管理学
- 5 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...

主题

7 篇 constraint satis...
5 篇 constraint progr...
5 篇 constraint theor...
2 篇 software enginee...
2 篇 iterative method...
2 篇 mathematical log...
2 篇 programming tech...
2 篇 programming lang...
2 篇 artificial intel...
2 篇 logics and meani...
1 篇 dynamical system...
1 篇 automation
1 篇 constrained opti...
1 篇 constraint optim...
1 篇 multiagent syste...
1 篇 computer aided d...
1 篇 linear programmi...
1 篇 mobile robot
1 篇 benchmarking
1 篇 vehicle routing

机构

2 篇 department of co...
2 篇 université côte ...
1 篇 ligm ecole des p...
1 篇 univ st andrews ...
1 篇 masaryk univ fac...
1 篇 chrstn. doppler ...
1 篇 college of compu...
1 篇 clayton school o...
1 篇 zuse institute b...
1 篇 ubisoft nouvelle...
1 篇 algorithms and c...
1 篇 alura são paulo
1 篇 insight centre f...
1 篇 mcp gmbh wien au...
1 篇 lab-sticc ensta-...
1 篇 institute of eco...
1 篇 technische unive...
1 篇 univ lyon insa l...
1 篇 monash universit...
1 篇 school of comput...

作者

2 篇 solnon christine
2 篇 isoart nicolas
2 篇 ordyniak sebasti...
2 篇 miguel ian
2 篇 jonsson peter
2 篇 nightingale pete...
2 篇 kotthoff lars
2 篇 quesada luis
2 篇 régin jean-charl...
2 篇 lagerkvist victo...
1 篇 genç begüm
1 篇 kohlenbrein wolf...
1 篇 gillard xavier
1 篇 ichimura ro
1 篇 stergiou kostas
1 篇 lafourcade pasca...
1 篇 gebser martin
1 篇 gelain mirco
1 篇 bedouhene abdera...
1 篇 walkiewicz danie...

语言

36 篇 英文
1 篇 中文

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

共 37 条记录，以下是1-10 订阅

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

详细简洁

排序：

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

27th International Conference on Principles and Practice of ...

引用

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

ISBN: (纸本)9783959772112

the proceedings contain 57 papers. the topics discussed include: filtering isomorphic models by invariants;unit propagation with stable watches;towards better heuristics for solving bounded model checking problems;integrating tree decompositions into decision heuristics of propositional model counters;generating magical performances with constraint programming;vehicle dynamics in pickup-and-delivery problems using electric vehicles;building high strength mixed covering arrays with constraints;on how turing and singleton arc consistency broke the enigma code;combining monte carlo tree search and depth first search methods for a car manufacturing workshop scheduling problem;practical bigraphs via subgraph isomorphism;the hybrid flexible flowshop with transportation times;and an interval constraint programming approach for quasi capture tube validation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generating magical performances with constraint programming 27

Generating magical performances with constraint programming

引用

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

作者： De Azevedo Silveira, Guilherme Alura São Paulo Brazil

ISBN: (纸本)9783959772112

Professional magicians employ the use of interesting properties of a deck of cards to create magical effects. these properties were traditionally discovered through trial and error, the application of heuristics or analytical proofs. We discuss the limitations of relying on humans for such methods and present how professional magicians can use constraint programming as a computer-aided design tool to search for desired properties in a deck of cards. Furthermore, we implement a solution in Python making use of generative magic to design a new effect, demonstrating how this process broadens the level of freedom a magician can decree to their volunteers while retaining control of the outcomes of the magic. Finally, we demonstrate the model can be easily adapted to multiple languages. © Guilherme de Azevedo Silveira.

关键词： Computer aided design

来源：评论

学校读者我要写书评

暂无评论

Counterfactual explanations via inverse constraint programming 27

Counterfactual explanations via inverse constraint programmi...

引用

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

作者： Korikov, Anton Beck, J. Christopher Department of Mechanical and Industrial Engineering University of Toronto Canada

ISBN: (纸本)9783959772112

It is increasingly recognized that automated decision making systems cannot be black boxes: users require insight into the reasons that decisions are made. Explainable AI (XAI) has developed a number of approaches to this challenge, including the framework of counterfactual explanations where an explanation takes the form of the minimal change to the world required for a user's desired decisions to be made. Building on recent work, we show that for a user query specifying an assignment to a subset of variables, a counterfactual explanation can be found using inverse optimization. thus, we develop inverse constraint programming (cp): to our knowledge, the first definition and treatment of inverse optimization in constraint programming. We modify a cutting plane algorithm for inverse mixed-integer programming (MIP), resulting in both pure and hybrid inverse cp algorithms. We evaluate the performance of these algorithms in generating counterfactual explanations for two combinatorial optimization problems: the 0-1 knapsack problem and single machine scheduling with release dates. Our numerical experiments show that a MIP-cp hybrid approach extended with a novel early stopping criteria can substantially out-perform a MIP approach particularly when cp is the state of the art for the underlying optimization problem. © Anton Korikov and J. Christopher Beck.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

the hybrid flexible flowshop with transportation times 27

The hybrid flexible flowshop with transportation times

引用

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

作者： Armstrong, Eddie Garraffa, Michele O'Sullivan, Barry Simonis, Helmut Johnson and Johnson Research Centre Limerick Ireland Confirm SFI Research Centre for Smart Manufacturing Limerick Ireland School of Computer Science University College Cork Ireland

ISBN: (纸本)9783959772112

this paper presents the hybrid, flexible flowshop problem with transportation times between stages, which is an extension of an existing scheduling problem that is well-studied in the literature. We explore different models for the problem with constraint programming, MILP, and local search, and compare them on generated benchmark problems that reflect the problem of the industrial partner. We then study two different factory layout design problems, and use the optimization tool to understand the impact of the design choices on the solution quality. © Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, and Helmut Simonis.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Fleet Design Optimisation for Multi-compartment Split-Delivery Rich Vehicle Routing 23rd

Constraint-Based Fleet Design Optimisation for Multi-compart...

引用

33rd international conference on Logic programming / 23rd international conference on principles and practice of constraint programming (cp) / 20th international conference on theory and Applications of Satisfiability Testing (SAT)

作者： Urli, Tommaso Kilby, Philip Australian Natl Univ ANU CSIRO Data61 Tower ALevel 37 London Circuit Canberra ACT 2601 Australia

ISBN: (纸本)9783319661582;9783319661575

We describe a large neighbourhood search (LNS) solver based on a constraint programming (cp) model for a real-world rich vehicle routing problem with compartments arising in the context of fuel delivery. Our solver supports both single-day and multi-day scenarios and a variety of real-world aspects including time window constraints, compatibility constraints, and split deliveries. It can be used both to plan the daily delivery operations, and to inform decisions on the long-term fleet composition. We show experimentally the viability of our approach.

关键词： Vehicle routing

来源：评论

学校读者我要写书评

暂无评论

Learning Max-CSPs via active constraint acquisition 27

Learning Max-CSPs via active constraint acquisition

引用

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

作者： Tsouros, Dimosthenis C. Stergiou, Kostas Dept. of Electrical and Computer Engineering University of Western Macedonia Kozani Greece

ISBN: (纸本)9783959772112

constraint acquisition can assist non-expert users to model their problems as constraint networks. In active constraint acquisition, this is achieved through an interaction between the learner, who posts examples, and the user who classifies them as solutions or not. Although there has been recent progress in active constraint acquisition, the focus has only been on learning satisfaction problems with hard constraints. In this paper, we deal with the problem of learning soft constraints in optimization problems via active constraint acquisition, specifically in the context of the Max-CSP. Towards this, we first introduce a new type of queries in the context of constraint acquisition, namely partial preference queries, and then we present a novel algorithm for learning soft constraints in Max-CSPs, using such queries. We also give some experimental results. © Dimosthenis C. Tsouros and Kostas Stergiou.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A job dispatcher for large and heterogeneous HPC systems running modern applications 27

A job dispatcher for large and heterogeneous HPC systems run...

引用

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

作者： Galleguillos, Cristian Kiziltan, Zeynep Soto, Ricardo Pontificia Universidad Católica de Valparaíso Chile University of Bologna Italy

ISBN: (纸本)9783959772112

High-performance Computing (HPC) systems have become essential instruments in our modern society. As they get closer to exascale performance, HPC systems become larger in size and more heterogeneous in their computing resources. With recent advances in AI, HPC systems are also increasingly being used for applications that employ many short jobs with strict timing requirements. HPC job dispatchers need to therefore adopt techniques to go beyond the capabilities of those developed for small or homogeneous systems, or for traditional compute-intensive applications. In this paper, we present a job dispatcher suitable for today's large and heterogeneous systems running modern applications. Unlike its predecessors, our dispatcher solves the entire dispatching problem using constraint programming (cp) with a model size independent of the system size. Experimental results based on a simulation study show that our approach can bring about significant performance gains over the existing cp-based dispatchers in a large or heterogeneous system. © Cristian Galleguillos, Zeynep Kiziltan, and Ricardo Soto.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Positive and negative length-bound reachability constraints 27

Positive and negative length-bound reachability constraints

引用

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

作者： Quesada, Luis Brown, Kenneth N. Insight Centre for Data Analytics School of Computer Science University College Cork Ireland

ISBN: (纸本)9783959772112

In many application problems, including physical security and wildlife conservation, infrastructure must be configured to ensure or deny paths between specified locations. We model the problem as sub-graph design subject to constraints on paths and path lengths, and propose length-bound reachability constraints. Although reachability in graphs has been modelled before in constraint programming, the interaction of positive and negative reachability has not been studied in depth. We prove that deciding whether a set of positive and negative reachability constraints are satisfiable is NP complete. We show the effectiveness of our approach on decision problems, and also on optimisation problems. We compare our approach with existing constraint models, and we demonstrate significant improvements in runtime and solution costs, on a new problem set. © Luis Quesada and Kenneth N. Brown.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Scheduling of Mobile Robots Using constraint programming 25th

Scheduling of Mobile Robots Using Constraint Programming

引用

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

作者： Murin, Stanislav Rudova, Hana Masaryk Univ Fac Informat Brno Czech Republic

ISBN: (纸本)9783030300487

Mobile robots in flexible manufacturing systems can transport components for jobs between machines as well as process jobs on selected machines. While the job shop problem with transportation resources allows encapsulating of transportation, this work concentrates on the extended version of the problem, including the processing by mobile robots. We propose a novel constraint programming model for this problem where the crucial part of the model lies in a proper inclusion of the transportation. We have implemented it in the Optimization programming Language using the cp Optimizer, and compare it with the existing mixed integer programming solver. While both approaches are capable of solving the problem optimally, a new constraint programming approach works more efficiently, and it can compute solutions in more than an order of magnitude faster. Given that, the results of more realistic data instances are delivered in real-time, which is very important in a smart factory.

关键词： Scheduling constraint programming Mobile robot Flexible manufacturing system Transportation IBM ILOG cpLEX Optimization Studio

来源：评论

学校读者我要写书评

暂无评论

SolverCheck: Declarative Testing of constraints 25th

SolverCheck: Declarative Testing of Constraints

引用

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

作者： Gillard, Xavier Schaus, Pierre Deville, Yves Catholic Univ Louvain Ottignies BE Belgium

ISBN: (纸本)9783030300487

this paper introduces SolverCheck, a property-based testing (PBT) library specifically designed to test cp solvers. In particular, SolverCheck provides a declarative language to express a propagator's expected behavior and test it automatically. that language is easily extended with new constraints and flexible enough to precisely describe a propagator's consistency. Experiments carried out using Choco [41], JaCoP [27] and Minicp [35] revealed the presence of numerous non-trivial bugs, no matter how carefully the test suites of these solvers have been engineered. Beyond the remarkable effectiveness of our technique to assess the correctness and robustness of a solver, our experiments also demonstrated the practical usability of SolverCheck to test actual cp-solvers.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：