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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

An Application of constraint programming to Superblock Instruction Scheduling

引用

14th international conference on principles and practice of constraint programming (cp 2008)

作者： Malik, Abid M. Chase, Michael Russell, Tyrel van Beek, Peter Univ Waterloo Cheriton Sch Comp Sci Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783540859574

Modern computer architectures have complex features that Can only be fully taken advantage of if tire compiler schedules the compiled code. A standard region of code for scheduling in an optimizing compiler is called a superblock. Scheduling superblocks optimally is known to be NP-complete, and production compilers rise non-optimal heuristic algorithms. In this paper;we present ill application of constraint programming to the superblock instruction scheduling problem. the resulting system is both optimal and fast enough to be incorporated into production compilers, awl is the first optimal superblock scheduler for realistic architectures. In developing our optimal scheduler, tire keys to scaling up to large;real problems were ill applying and adapting several techniques from the literature including: implied gild dominance constraints, impact-based variable ordering heuristics, singleton bounds consistency, portfolios;and structure-based decomposition techniques. We experimentally evaluated our optimal scheduler oil the SPEC 2000 benchmarks, a standard benchmark suite. Depending oil the architectural model, between 98.29% to 99.98% of all superblocks were solved to optimality. the scheduler was able to routinely solve tire largest superblocks, including superblocks with up to 2,600 instructions, and gave noteworthy improvements over previous heuristic approaches.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Solution counting algorithms for constraint-centered search heuristics

Solution counting algorithms for constraint-centered search ...

引用

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

作者： Zanarini, Alessandro Pesant, Gilles Ecole Polytech Dept Comp & Software Engn Montreal PQ H3C 3A7 Canada

ISBN: (纸本)3540749691

constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. this paper intends to do the same thing for search, proposing constraint-centered heuristics which guide the exploration of the search space toward areas that are likely to contain a high number of solutions. We first propose new search heuristics based on solution counting information at the level of individual constraints. We then describe efficient algorithms to evaluate the number of solutions of two important families of constraints: occurrence counting constraints, such as all different, and sequencing constraints, such as regular. In both cases we take advantage of existing filtering algorithms to speed up the evaluation. Experimental results on benchmark problems show the effectiveness of our approach.

关键词： Solution counting Heuristic search Regular constraint Alldifferent constraint

来源：评论

学校读者我要写书评

暂无评论

A Join-Based Hybrid Parameter for constraint Satisfaction 25th

A Join-Based Hybrid Parameter for Constraint Satisfaction

引用

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

作者： Ganian, Robert Ordyniak, Sebastian Szeider, Stefan TU Wien Algorithms & Complex Grp Vienna Austria Univ Sheffield Algorithms Grp Sheffield S Yorkshire England

ISBN: (纸本)9783030300487

We propose joinwidth, a new complexity parameter for the constraint Satisfaction Problem (CSP). the definition of joinwidth is based on the arrangement of basic operations on relations (joins, projections, and pruning), which inherently reflects the steps required to solve the instance. We use joinwidth to obtain polynomial-time algorithms (if a corresponding decomposition is provided in the input) as well as fixed-parameter algorithms (if no such decomposition is provided) for solving the CSP. Joinwidth is a hybrid parameter, as it takes both the graphical structure as well as the constraint relations that appear in the instance into account. It has, therefore, the potential to capture larger classes of tractable instances than purely structural parameters like hypertree width and the more general fractional hypertree width (fhtw). Indeed, we show that any class of instances of bounded fhtw also has bounded joinwidth, and that there exist classes of instances of bounded joinwidth and unbounded fhtw, so bounded joinwidth properly generalizes bounded fhtw. We further show that bounded joinwidth also properly generalizes several other known hybrid restrictions, such as fhtw with degree constraints and functional dependencies. In this sense, bounded joinwidth can be seen as a unifying principle that explains the tractability of several seemingly unrelated classes of CSP instances.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

constraint-based lagrangian relaxation

Constraint-based lagrangian relaxation

引用

20th international conference on the principles and practice of constraint programming, cp 2014

作者： Fontaine, Daniel Laurentmichel, L. Van Hentenryck, Pascal University of Connecticut Storrs CT 06269-2155 United States NICTA Australian National University Australia

ISBN: (纸本)9783319104270

this paper studies how to generalize Lagrangian relaxation to high-level optimization models, including constraint-programming and local search models. It exploits the concepts of constraint violation (typically used in constraint programming and local search) and constraint satisfiability (typically exploited in mathematical programming). the paper considers dual and primal methods, studies their properties, and discusses how they can be implemented in terms of high-level model combinators and algorithmic templates. Experimental results suggest the potential benefits of Lagrangian methods for improving high-level constraint programming and local search models. © 2014 Springer international Publishing Switzerland.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint propagation: Between abstract models and ad hoc strategies 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Granvilliers, Laurent Monfroy, Eric IRIN B.P. 92208 Nantes Cedex 3F-44322 France CWI Kruislaan 413 Amsterdam1098 SJ Netherlands

ISBN: (纸本)3540410538

constraint propagation [10,7,5] (cp) is a cornerstone algorithm of constraint programming, mainly devoted to the computation of local consistency properties of constraint satisfaction problems. the abstract formulation of cp is the combination of a set of reduction functions (black-box solvers) on a domain [8,9,2,1]. Intuitively, there is a dependence relation between functions and domains, such that a function must be applied if a domain it depends on is reduced. the essential property of cp is confluence or strategy-independence. In other words, the order solvers are applied does not influence the output characterized in terms of a common fixed-point of the solvers. Owing to this remark, several strategies based on heuristics, data structures, or knowledge of the solvers have been implemented.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Certainty closure - A framework for reliable constraint reasoning with uncertainty

引用

9th international conference on principles and practice of constraint programming

作者： Yorke-Smith, N Gervet, C Univ London Imperial Coll Sci Technol & Med IC Parc London SW7 2AZ England

ISBN: (纸本)3540202021

constraint problems with incomplete or erroneous data are often simplified to tractable deterministic models, or modified using error correction methods, with the aim of seeking a solution. However, this can lead us to solve the wrong problem because of the approximations made. Such an outcome is of little help to a user who expects the right problem to be tackled and reliable information returned. the certainty closure framework we present aims to provide the user with reliable insight by: (1) enclosing the uncertainty using what is known for sure about the data, to guarantee that the true problem is contained in the model so described, (2) deriving a closure, a set of possible solutions to the uncertain constraint problem. In this paper we first demonstrate the benefits of reliable constraint reasoning on two different case studies, and then generalise our approaches into a formal framework.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

the Complexity of Valued constraint Models

The Complexity of Valued Constraint Models

引用

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

作者： Zivny, Stanislav Jeavons, Peter G. Univ Oxford Comp Lab Oxford OX1 3QD England

ISBN: (纸本)9783642042430

the VALUED constraint SATISFACTION PROBLEM (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what;it means for a, problem to be modelled in the VCSP framework. Using our analysis, we show that some optimisation problems, such as (s,t)-MIN-CUT and SUBMODULAR FUNCTION MINIMISATION, can be modelled using a restricted Set Of valued constraints which axe tractable to solve regard less of how they are combined. Hence, these problems can be viewed as special cases of more general problems which include all possible instances rising the same forms., of valued constraint. However, other, apparently similar, problems such as MINCUT and SYMMETRIC SUBMODULAR FUNCTION MINIMISATION, which also have polynomial-time algorithms, can only be naturally modelled in the VCSP framework by using valued constraints which can represent NP-complete problems. this suggests that the reason for tractability ill these problems is more subtle: it relies not;Only Oil the form of the valued constraints, but;also on the precise structure of the problem. Furthermore, our results suggest that allowing constant constraints can significantly alter the complexity of problems in the VScp framework, in contrast, to the CSP framework.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Michela Milano

ISBN: (数字)9783642335587

ISBN: (纸本)9783642335570

this book constitutes the thoroughly refereed post-conference proceedings of the 18th international conference on principles and practice of constraint programming (cp 2012), held in Québec, Canada, in October 2012. the 68 revised full papers were carefully selected from 186 submissions. Beside the technical program, the conference featured two special tracks. the former was the traditional application track, which focused on industrial and academic uses of constraint technology and its comparison and integration with other optimization techniques (MIP, local search, SAT, etc.) the second track, featured for the first time in 2012, concentrated on multidisciplinary papers: cross-cutting methodology and challenging applications collecting papers that link cp technology with other techniques like machine learning, data mining, game theory, simulation, knowledge compilation, visualization, control theory, and robotics. In addition, the track focused on challenging application fields with a high social impact such as cp for life sciences, sustainability, energy efficiency, web, social sciences, finance, and verification.

关键词： Mathematical Logic and Formal Languages Numeric Computing Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Discrete Mathematics in Computer Science programming Languages, Compilers, Interpreters

来源：评论

学校读者我要写书评

暂无评论

Decomposition of the NVALUE constraint

Decomposition of the NVALUE Constraint

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Bessiere, Christian Katsirelos, George Narodytska, Nina Quimper, Claude-Guy Walsh, Toby CNRS LIRMM Montpellier France CNRS CRIL Lens France NICTA Sydney NSW Australia Univ NSW Sydney NSW Australia Univ Laval Quebec City PQ G1K 7P4 Canada

ISBN: (纸本)9783642153952

We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposition can simulate with the same time complexity but with a much greater space complexity. this suggests that the benefit of a global propagator may often not be in saving time but in saving space. Our other theoretical contribution is to show for the first time that range consistency can be enforced on NVALUE with the same worst-case time complexity as bound consistency. Finally, the decompositions we study are readily encoded as linear inequalities. We are therefore able to use them in integer linear programs.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Bin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres

Bin Packing with Linear Usage Costs - An Application to Ener...

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Cambazard, Hadrien Mehta, Deepak O'Sullivan, Barry Simonis, Helmut Univ Grenoble G SCOP INP Grenoble France UJF CNRS Grenoble France Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783642406263;9783642406270

EnergeTIC is a recent industrial research project carried out in Grenoble on optimizing energy consumption in data-centres. the efficient management of a data-centre involves minimizing energy costs while ensuring service quality. We study the problem formulation proposed by EnergeTIC. First, we focus on a key sub-problem: a bin packing problem with linear costs associated with the use of bins. We study lower bounds based on Linear programming and extend the bin packing global constraint with cost information. Second, we present a column generation model for computing the lower bound on the original energy management problem where the pricing problem is essentially a cost-aware bin packing with side constraints. third, we show that the industrial benchmark provided so far can be solved to near optimality using a large neighborhood search.

关键词： Energy management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：