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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

33 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

30 篇 工学
- 30 篇 计算机科学与技术...
- 23 篇 软件工程
- 2 篇 控制科学与工程
- 2 篇 生物工程
- 1 篇 机械工程
- 1 篇 光学工程
26 篇 理学
- 23 篇 数学
- 15 篇 系统科学
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...

主题

5 篇 constraint satis...
4 篇 constraint theor...
3 篇 constraint progr...
2 篇 computational co...
2 篇 practical applic...
2 篇 constraint answe...
2 篇 answer set progr...
2 篇 non-herbrand fun...
1 篇 conceptual desig...
1 篇 reinforcement le...
1 篇 constraint satis...
1 篇 graph homomorphi...
1 篇 optimal systems
1 篇 iterative method...
1 篇 constrained opti...
1 篇 random variables
1 篇 linear programmi...
1 篇 global constrain...
1 篇 local search (op...
1 篇 computer program...

机构

2 篇 university of lu...
2 篇 sics p.o. box 12...
2 篇 luxembourg
2 篇 eastman kodak co...
1 篇 ecole normale su...
1 篇 amazon quantum s...
1 篇 h. milton stewar...
1 篇 faculty of scien...
1 篇 polytechnique mo...
1 篇 univ collegc cor...
1 篇 lina fre cnrs 27...
1 篇 univ pavia dipar...
1 篇 department of th...
1 篇 tasc imt-atlanti...
1 篇 lina fre cnrs 27...
1 篇 département de m...
1 篇 univ helsinki de...
1 篇 the apes researc...
1 篇 swedish institut...
1 篇 natl univ irelan...

作者

2 篇 balduccini marce...
2 篇 beldiceanu nicol...
2 篇 talbot pierre
2 篇 carlsson mats
1 篇 solnon christine
1 篇 zheng kexin
1 篇 holland a
1 篇 gamache michel
1 篇 boonbandansook w...
1 篇 paparrizou anast...
1 篇 oikarinen emilia
1 篇 lallouet arnaud
1 篇 letort arnaud
1 篇 rousseau louis-m...
1 篇 van hentenryck p...
1 篇 o'callaghan b
1 篇 berden senne
1 篇 malapert arnaud
1 篇 deville yves
1 篇 ågren magnus

语言

34 篇 英文
1 篇 中文

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

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

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

详细简洁

排序：

29th international conference on principles and practice of constraint programming, cp 2023

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

引用

29th international conference on principles and practice of constraint programming, cp 2023

ISBN: (纸本)9783959773003

the proceedings contain 46 papers. the topics discussed include: beyond optimal solutions for real-world problems;beyond optimal solutions for real-world problems;coupling cp with deep learning for molecular design and SARS-CoV2 variants exploration;cp solver design for maximum cpU utilization;optimization of short-term underground mine planning using constraint programming;symmetries for cube-and-conquer in finite model finding;guiding backtrack search by tracking variables during constraint propagation;incremental constrained clustering by minimal weighted modification;simplifying step-wise explanation sequences;towards more efficient local search for pseudo-Boolean optimization;boosting decision diagram-based branch-and-bound by pre-solving with aggregate dynamic programming;and fast matrix multiplication without tears: a constraint programming approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fast Matrix Multiplication Without Tears: A constraint programming Approach 29

Fast Matrix Multiplication Without Tears: A Constraint Progr...

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Deza, Arnaud Liu, Chang Vaezipoor, Pashootan Khalil, Elias B. Department of Mechanical and Industrial Engineering University of Toronto Canada Department of Computer Science University of Toronto Canada

ISBN: (纸本)9783959773003

It is known that the multiplication of an N ×M matrix with an M ×P matrix can be performed using fewer multiplications than what the naive NMP approach suggests. the most famous instance of this is Strassen's algorithm for multiplying 2 × 2 matrices in 7 instead of 8 multiplications. this gives rise to the constraint satisfaction problem of fast matrix multiplication, where a set of R © Arnaud Deza, Chang Liu, Pashootan Vaezipoor, and Elias B. Khalil.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Optimization of Short-Term Underground Mine Planning Using constraint programming 29

Optimization of Short-Term Underground Mine Planning Using C...

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Aalian, Younes Pesant, Gilles Gamache, Michel Département de Mathématiques et de Génie Industriel Polytechnique Montréal QC Canada Département de Génie Informatique et Génie Logiciel Polytechnique Montréal QC Canada

ISBN: (纸本)9783959773003

Short-term underground mine planning problems are often difficult to solve due to the large number of activities and diverse machine types to be scheduled, as well as multiple operational constraints. this paper presents a constraint programming (cp) model to optimize short-term scheduling for the Meliadine underground gold mine in Nunavut, Canada, taking into consideration operational constraints and the daily development and production targets of the mine plan. To evaluate the efficacy of the developed cp short-term planning model, we compare schedules generated by the cp model with the ones created manually by the mine planner for two real data sets. Results demonstrate that the cp model outperforms the manual approach by generating more efficient schedules with lower makespans. © Younes Aalian, Gilles Pesant, and Michel Gamache.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with constraint programming 29

Using Canonical Codes to Efficiently Solve the Benzenoid Gen...

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Peng, Xiao Solnon, Christine Univ Lyon INSA Lyon Inria CITI EA3720 Villeurbanne69621 France

ISBN: (纸本)9783959773003

the Benzenoid Generation Problem (BGP) aims at generating all benzenoid molecules that satisfy some given properties. this problem has important applications in chemistry, and Carissan et al (2021) have shown us that constraint programming (cp) is well suited for modelling this problem because properties defined by chemists are easy to express by means of constraints. Benzenoids are described by hexagon graphs and a key point for an efficient enumeration of these graphs is to be invariant to rotations and symmetries. In this paper, we introduce canonical codes that uniquely characterise hexagon graphs while being invariant to rotations and symmetries. We show that these codes may be defined by means of constraints. We also introduce a global constraint for ensuring that codes are canonical, and a global constraint for ensuring that a pattern is included in a code. We experimentally compare our new cp model with the cp-based approach of Carissan et al (2021), and we show that it has better scale-up properties. © Xiao Peng and Christine Solnon.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

An Efficient constraint programming Approach to Preemptive Job Shop Scheduling 29

An Efficient Constraint Programming Approach to Preemptive J...

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Juvin, Carla Hebrard, Emmanuel Houssin, Laurent Lopez, Pierre LAAS-CNRS Université de Toulouse France ISAE-SUPAERO Université de Toulouse France

ISBN: (纸本)9783959773003

constraint programming has been widely, and very successfully, applied to scheduling problems. However, the focus has been on uninterruptible tasks, and preemptive scheduling problems are typically harder for existing constraint solvers. Indeed, one usually needs to represent all potential task interruptions thus introducing many variables and symmetrical or dominated choices. In this paper, building on mostly known results, we observe that a large class of preemptive disjunctive scheduling problems do not require an explicit model of task interruptions. We then introduce a new constraint programming approach for this class of problems that significantly outperforms state-of-the-art dedicated approaches in our experimental results. © Carla Juvin, Emmanuel Hebrard, Laurent Houssin, and Pierre Lopez.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing 29

Constraint Programming Models for Depth-Optimal Qubit Assign...

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Booth, Kyle E.C. Amazon Quantum Solutions Lab SeattleWA United States

ISBN: (纸本)9783959773003

Due to the limited connectivity of gate model quantum devices, logical quantum circuits must be compiled to target hardware before they can be executed. Often, this process involves the insertion of SWAP gates into the logical circuit, usually increasing the depth of the circuit, achieved by solving a so-called qubit assignment and routing problem. Recently, a number of integer linear programming (ILP) models have been proposed for solving the qubit assignment and routing problem to proven optimality. these models encode the objective function and constraints of the problem, and leverage the use of automated solver technology to find hardware-compliant quantum circuits. In this work, we propose constraint programming (cp) models for this problem and compare their performance against ILP for circuit depth minimization for both linear and two-dimensional grid lattice device topologies on a set of randomly generated instances. Our empirical analysis indicates that the proposed cp approaches outperform the ILP models both in terms of solution quality and runtime. © Kyle E. C. Booth.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Linear concurrent constraint programming over reals 4th

Linear concurrent constraint programming over reals

引用

4th international conference on principles and practice of constraint programming (cp 98)

作者： Schachter, V Ecole Normale Super Liens F-75005 Paris France

ISBN: (纸本)3540652248

We introduce a constraint system LC that handles arithmetic constraints over reals within the linear concurrent constraint programming (Icc) framework. this approach provides us with a general, extensible foundation for linear programming algorithm design that comes with a (linear) logical semantics. In particular, it allows us to build a 'glass-box' version of the (constraint solver) simplex algorithm by defining (monotone) cc ask and tell agents over a higher-level constraint system as Icc(LC) programs. We illustrate at the same time the use of the lccframework as a non-trivial concurrent algorithm specification tool.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

constraint programming with External Worst-Case Traversal Time Analysis 29

Constraint Programming with External Worst-Case Traversal Ti...

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Talbot, Pierre Hu, Tingting Navet, Nicolas University of Luxembourg Luxembourg Luxembourg

ISBN: (纸本)9783959773003

the allocation of software functions to processors under compute capacity and network links constraints is an important optimization problem in the field of embedded distributed systems. We present a hybrid approach to solve the allocation problem combining a constraint solver and a worst-case traversal time (WCTT) analysis that verifies the network timing constraints. the WCTT analysis is implemented as an industrial black-box program, which makes a tight integration with constraint solving challenging. We contribute to a new multi-objective constraint solving algorithm for integrating external under-approximating functions, such as the WCTT analysis, with constraint solving, and prove its correctness. We apply this new algorithm to the allocation problem in the context of automotive service-oriented architectures based on Ethernet networks, and provide a new dataset of realistic instances to evaluate our approach. © Pierre Talbot, Tingting Hu, and Nicolas Navet.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

constraint programming to Improve Hub Utilization in Autonomous Transfer Hub Networks 29

Constraint Programming to Improve Hub Utilization in Autonom...

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Lee, Chungjae Boonbandansook, Wirattawut Akhlaghi, Vahid Eghbal Dalmeijer, Kevin Van Hentenryck, Pascal H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology AtlantaGA United States

ISBN: (纸本)9783959773003

the Autonomous Transfer Hub Network (AthN) is one of the most promising ways to adapt self-driving trucks for the freight industry. these networks use autonomous trucks for the middle mile, while human drivers perform the first and last miles. this paper extends previous work on optimizing AthN operations by including transfer hub capacities, which are crucial for labor planning and policy design. It presents a constraint programming (cp) model that shifts an initial schedule produced by a Mixed Integer Program to minimize the hub capacities. the scalability of the cp model is demonstrated on a case study at the scale of the United States, based on data provided by Ryder System, Inc. the cp model efficiently finds optimal solutions and lowers the necessary total hub capacity by 42%, saving $15.2M in annual labor costs. the results also show that the reduced capacity is close to a theoretical (optimistic) lower bound. © Chungjae Lee, Wirattawut Boonbandansook, Vahid Eghbal Akhlaghi, Kevin Dalmeijer, and Pascal Van Hentenryck.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

Distribution Optimization in constraint programming 29

Distribution Optimization in Constraint Programming

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Perez, Guillaume Glorian, Gaël Suijlen, Wijnand Lallouet, Arnaud Huawei Technologies Ltd CSI Paris Boulogne-Billancourt France

ISBN: (纸本)9783959773003

Stochastic constraint programming introduces stochastic variables following a probability distribution to model uncertainty. In the classical setting, probability distributions are given and constant. We propose a framework in which random variables are given a set of possible distributions and only one should be selected. A solution is obtained when all variable distributions are assigned, and all decision variables are assigned too. In such a setting, a constraint on random variables limits the possible distributions its random variables may take. We generalize the notion of chance as the probability of satisfaction of a constraint, called probabilization, given variable distributions. Probabilization can be seen as a generalization of reification in a random setting whose result is a random variable. We define minimal arithmetic to work with stochastic variables having a variable distribution. Using the introduced representation, our framework can in theory save an exponential number of decisions, and represents problems that were previously not representable with finite integer domains. Finally, we model and solve two industrial problems that require this extension - virtual network configuration and assignment of chemical delivery - and show improvement in terms of quality of solution and speed. © Guillaume Perez, Gaël Glorian, Wijnand Suijlen, and Arnaud Lallouet.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：