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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

309 篇 会议
8 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

274 篇 工学
- 267 篇 计算机科学与技术...
- 165 篇 软件工程
- 27 篇 信息与通信工程
- 19 篇 电气工程
- 4 篇 化学工程与技术
- 3 篇 动力工程及工程热...
- 3 篇 土木工程
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 石油与天然气工程
192 篇 理学
- 143 篇 数学
- 116 篇 系统科学
- 7 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 化学
- 3 篇 生物学
- 1 篇 地球物理学
24 篇 管理学
- 22 篇 管理科学与工程(可...
- 15 篇 工商管理
- 3 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

64 篇 constraint theor...
52 篇 constraint satis...
31 篇 constraint progr...
11 篇 constrained opti...
8 篇 problem solving
7 篇 scheduling
6 篇 mathematical log...
5 篇 artificial intel...
4 篇 modeling languag...
4 篇 model checking
4 篇 optimization
4 篇 programming lang...
4 篇 logics and meani...
3 篇 polynomial appro...
3 篇 constraint handl...
3 篇 semantics
3 篇 algorithm analys...
3 篇 regular constrai...
2 篇 solution countin...
2 篇 software enginee...

机构

5 篇 cork constraint ...
5 篇 cork constraint ...
4 篇 ecole polytech m...
4 篇 fraunhofer first...
4 篇 natl univ irelan...
4 篇 kth royal inst t...
4 篇 mines de nantes
4 篇 brown univ provi...
3 篇 univ bologna dei...
3 篇 nicta nsw
3 篇 university of co...
3 篇 161 rue ada mont...
3 篇 iiia-csic campus...
3 篇 univ connecticut...
3 篇 natl univ irelan...
3 篇 univ coll cork c...
3 篇 univ london impe...
3 篇 univ toronto dep...
2 篇 lund university ...
2 篇 university of pa...

作者

16 篇 stuckey peter j.
11 篇 o'sullivan barry
9 篇 bessiere christi...
8 篇 miguel ian
8 篇 beldiceanu nicol...
8 篇 hebrard emmanuel
8 篇 pesant gilles
7 篇 van hentenryck p...
7 篇 walsh toby
7 篇 schulte christia...
7 篇 quimper claude-g...
6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 choueiry berthe ...
6 篇 simonis helmut
6 篇 schaus pierre
5 篇 rousseau louis-m...
5 篇 hnich brahim
5 篇 deville yves
5 篇 bessière christi...

语言

322 篇 英文
1 篇 中文

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

共 323 条记录，以下是221-230 订阅

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

详细简洁

排序：

Groups and constraints: Symmetry breaking during search 8th

引用

8th international conference on principles and practice of constraint programming, cp 2002

作者： Gent, Ian P. Harvey, Warwick Kelsey, Tom School of Computer Science University of St Andrews St Andrews FifeKY16 9SS United Kingdom IC-Parc Imperial College Exhibition Road LondonSW7 2AZ United Kingdom

ISBN: (纸本)3540441204

We present an interface between the ECLiPSe constraint logic programming system and the GAP computational abstract algebra system. the interface provides a method for efficiently dealing with large numbers of symmetries of constraint satisfaction problems for minimal programming effort. We also report an implementation of SBDS using the GAP-ECLiPSe interface which is capable of handling many more symmetries than previous implementations and provides improved search performance for symmetric constraint satisfaction problems. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Improving Energetic Propagations for Cumulative Scheduling 1

引用

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

作者： Tesch, Alexander Zuse Inst Berlin ZIB Takustr 7 D-14195 Berlin Germany

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

We consider the Cumulative Scheduling Problem (CuSP) in which a set of n jobs must be scheduled according to release dates, due dates and cumulative resource constraints. In constraint programming, the CuSP is modeled as the cumulative constraint. Among the most common propagation algorithms for the CuSP there is energetic reasoning [1] with a complexity of O(n(3)) and edge-finding [21] with O(kn log n) where k <= n is the number of different resource demands. We consider the complete versions of the propagators that perform all deductions in one call of the algorithm. In this paper, we introduce the energetic edge-finding rule that is a generalization of both energetic reasoning and edge-finding. Our main result is a complete energetic edge-finding algorithm with a complexity of O(n(2) log n) which improves upon the complexity of energetic reasoning. Moreover, we show that a relaxation of energetic edge-finding with a complexity of O(n(2)) subsumes edge-finding while performing stronger propagations from energetic reasoning. A further result shows that energetic edge-finding reaches its fixpoint in strongly polynomial time. Our main insight is that energetic schedules can be interpreted as a single machine scheduling problem from which we deduce a monotonicity property that is exploited in the algorithms. Hence, our algorithms improve upon the strength and the complexity of energetic reasoning and edge-finding whose complexity status seemed widely untouchable for the last decades.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Scheduling for cellular manufacturing

Scheduling for cellular manufacturing

引用

13th international conference on principles and practice of constraint programming (cp 2007)

作者： van der Krogt, Roman Little, James Pulliam, Kenneth Hanhilammi, Sue Jin, Yue Univ Coll Cork Dept Comp Sci Cork Constraint Computat Ctr Cork Ireland Alcatel Lucent Syst Integrat Ctr Columbus OH USA Bell Labs Res Ctr Dublin Ireland

ISBN: (纸本)9783540749691

Alcatel-Lucent is a major player in the field of telecommunications. One of the products it offers to network operators is wireless infrastructure such as base stations. Such equipment is delivered in cabinets. these cabinets are packed with various pieces of electronics: filters, amplifiers, circuit packs, etc. the exact configuration of a cabinet is dependent upon the circumstances it is being placed in, and some 20 product groups can be distinguished. However, the variation in cabinets is large, even within one product group. For this reason, they are built to order. In order to improve cost, yield and delivery performance, lean manufacturing concepts were applied to change the layout of the factory to one based on cells. these cells focus on improving manufacturing through standardised work, limited changeovers between product groups and better utilisation of test equipment. A key component in the implementation of these improvements is a system which schedules the cells to satisfy customer request dates in an efficient sequence. this paper describes the transformation and the tool that was built to support the new method of operations. the implementation has achieved significant improvements in manufacturing interval, work in process inventory, first test yield, headcount, quality (i.e. fewer defects are found during the testing stage) and delivery performance. Although these benefits are mainly achieved because of the change to a cell layout, the scheduling tool is crucial in realising the full potential of it.

关键词： Cellular manufacturing

来源：评论

学校读者我要写书评

暂无评论

Exponential Steepest Ascent from Valued constraint Graphs of Pathwidth Four 30

Exponential Steepest Ascent from Valued Constraint Graphs of...

引用

30th international conference on principles and practice of constraint programming, cp 2024

作者： Kaznatcheev, Artem Van Marle, Melle Department of Mathematics Department of Information and Computing Sciences Utrecht University Netherlands

ISBN: (纸本)9783959773362

We examine the complexity of maximising fitness via local search on valued constraint satisfaction problems (VCSPs). We consider two kinds of local ascents: (1) steepest ascents, where each step changes the domain that produces a maximal increase in fitness;and (2) -ordered ascents, where - of the domains with available fitness increasing changes - each step changes the -minimal domain. We provide a general padding argument to simulate any ordered ascent by a steepest ascent. We construct a VCSP that is a path of binary constraints between alternating 2-state and 3-state domains with exponentially long ordered ascents. We apply our padding argument to this VCSP to obtain a Boolean VCSP that has a constraint (hyper)graph of arity 5 and pathwidth 4 with exponential steepest ascents. this is an improvement on the previous best known construction for long steepest ascents, which had arity 8 and pathwidth 7. © Artem Kaznatcheev and Melle van Marle.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Reasoning about Optimal Collections of Solutions

Reasoning about Optimal Collections of Solutions

引用

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

作者： Hadzic, Tarik Holland, Alan O'Sullivan, Barry Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Dept Comp Sci Cork Ireland

ISBN: (纸本)9783642042430

the problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of ail inter-solution objective function exists in many application settings. For example, maximizing diversity amongst a set of solutions in a product configuration setting is desirable so that a wide range of different options is offered to a customer. Given the computationally Challenging nature of these multi-resolution queries, existing algorithmic approaches either apply heuristics or combinatorial search, which does not scale to large solution spaces. However, in many domains compiling the original problem into a compact representation call support computationally efficient query answering. In this paper we present a new approach to find optimal collections of solutions when the problem is compiled into a multi-valued decision diagram. We demonstrate empirically that for real-world configuration problems, both exact and approximate versions of our methods are effective and are capable of significantly outperforming state-of-the-art search-based techniques.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Techniques in Stochastic Local Search MaxSAT Solving 25th

Constraint-Based Techniques in Stochastic Local Search MaxSA...

引用

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

作者： Guerreiro, Andreia P. Terra-Neves, Miguel Lynce, Ines Figueira, Jose Rui Manquinho, Vasco Univ Lisbon Inst Super Tecn INESC ID Lisbon Portugal OutSystems Lisbon Portugal Univ Lisbon Inst Super Tecn CEG IST Lisbon Portugal

ISBN: (纸本)9783030300487

the recent improvements in solving Maximum Satisfiability (MaxSAT) problems has allowed the usage of MaxSAT in several application domains. However, it has been observed that finding an optimal solution in a reasonable amount of time remains a challenge. Moreover, in many applications it is enough to provide a good approximation of the optimum. Recently, new local search algorithms have been shown to be successful in approximating the optimum in MaxSAT problems. Nevertheless, these local search algorithms fail in finding feasible solutions to highly constrained instances. In this paper, we propose two constraint-based techniques for improving local search MaxSAT solvers. Firstly, an unsatisfiability-based algorithm is used to guide the local search solver into the feasible region of the search space. Secondly, given a partial assignment, we perform Minimal Correction Subsets (MCS) enumeration in order to improve upon the best solution found by the local search solver. Experimental results using a large set of instances from the MaxSAT evaluation 2018 show the effectiveness of our approach.

关键词： Maximum Satisfiability Local search Incomplete algorithms

来源：评论

学校读者我要写书评

暂无评论

the Confidence constraint: A Step Towards Stochastic cp Solvers 26th

The Confidence Constraint: A Step Towards Stochastic CP Solv...

引用

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

作者： Mercier-Aubin, Alexandre Dumetz, Ludwig Gaudreault, Jonathan Quimper, Claude-Guy Université Laval G1V 0A6 QuébecQC Canada

ISBN: (纸本)9783030584740

We introduce the Confidence constraint, a chance constraint that ensures, with probability, that a set of variables are no smaller than random variables for which the probability distribution is given. this constraint is useful in stochastic optimization to ensure that a solution is robust to external random events. It allows to control the trade-off between optimizing the objective function and ensuring the satisfiability of the solution under random parameters. We present a filtering algorithm for this constraint with explanations. We apply the constraint to a case study, an industrial scheduling problem where tasks have random processing times due to possible breakdowns during their execution. We evaluate our solutions with simulations and show that this new constraint allows robust solutions in decent computation time. © 2020, Springer Nature Switzerland AG.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean constraints 25th

Automatic Detection of At-Most-One and Exactly-One Relations...

引用

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

作者： Ansotegui, Carlos Bofill, Miquel Coll, Jordi Nguyen Dang Luis Esteban, Juan Miguel, Ian Nightingale, Peter Salamon, Andras Z. Suy, Josep Villaret, Mateu Univ Lleida Lleida Spain Univ Girona Girona Spain Univ St Andrews St Andrews Fife Scotland Tech Univ Catalonia Barcelona Spain Univ York York N Yorkshire England

ISBN: (纸本)9783030300487

Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB constraints to SAT has proven to be an efficient approach in many applications, however care must be taken to encode them compactly and with good propagation properties. It has been shown that at-most-one (AMO) and exactly-one (EO) relations over subsets of the variables can be exploited in various encodings of PB constraints, improving their compactness and solving performance. In this paper we detect AMO and EO relations completely automatically and exploit them to improve SAT encodings that are based on Multi-Valued Decision Diagrams (MDDs). Our experiments show substantial reductions in encoding size and dramatic improvements in solving time thanks to automatic AMO and EO detection.

关键词： Automatic CSP reformulation SAT Pseudo-Boolean At-most-one constraint

来源：评论

学校读者我要写书评

暂无评论

the Argmax constraint 26th

The Argmax Constraint

引用

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

作者： Gange, Graeme Stuckey, Peter J. Monash University Melbourne Australia

ISBN: (纸本)9783030584740

the argmax function returns the index of the (first copy of the) maximum value occuring in a list of values. argmax is important in models where we choose a characteristic value based on a seperate criteria, and for modelling neural networks which make use of argmax in their definition. the argmax constraint has been studied for the special case of its use to find the index of the first true in a list of Booleans, since this is useful for encoding if-then-else chains. Here we examine the general argmax constraint for the first time. We define an efficient domain consistent propagator and a decomposition for integers which implements domain consistency. © 2020, Springer Nature Switzerland AG.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Inter-instance nogood learning in constraint programming

Inter-instance nogood learning in constraint programming

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Chu, Geoffrey Stuckey, Peter J. National ICT Australia Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9783642335570

Lazy Clause Generation is a powerful approach to reducing search in constraint programming. this is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators called nogoods. this dramatically reduces the search and provides orders of magnitude speedups on a wide range of problems. Current implementations of Lazy Clause Generation only allows solvers to learn and utilize nogoods within an individual problem. this means that everything the solver learns will be forgotten as soon as the current problem is finished. In this paper, we show how Lazy Clause Generation can be extended so that nogoods learned from one problem can be retained and used to significantly speed up the solution of other, similar problems. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：