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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,005 篇 会议
51 篇 期刊文献
20 册 图书

馆藏范围

1,075 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

900 篇 工学
- 876 篇 计算机科学与技术...
- 526 篇 软件工程
- 45 篇 信息与通信工程
- 29 篇 电气工程
- 22 篇 控制科学与工程
- 10 篇 机械工程
- 6 篇 建筑学
- 6 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 农业工程
- 5 篇 生物工程
- 4 篇 动力工程及工程热...
- 3 篇 航空宇航科学与技...
- 3 篇 环境科学与工程（可...
551 篇 理学
- 436 篇 数学
- 283 篇 系统科学
- 19 篇 统计学（可授理学、...
- 11 篇 物理学
- 8 篇 生物学
- 5 篇 化学
84 篇 管理学
- 69 篇 管理科学与工程(可...
- 44 篇 工商管理
- 18 篇 图书情报与档案管...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
5 篇 农学
- 5 篇 作物学
2 篇 教育学
- 2 篇 教育学
1 篇 军事学

主题

197 篇 constraint theor...
162 篇 constraint satis...
64 篇 constraint progr...
26 篇 constrained opti...
26 篇 logic programmin...
24 篇 computer program...
24 篇 answer set progr...
21 篇 integer programm...
18 篇 scheduling
15 篇 artificial intel...
15 篇 dynamic programm...
14 篇 mathematical log...
13 篇 problem solving
12 篇 linear programmi...
12 篇 programming lang...
10 篇 global constrain...
10 篇 logics and meani...
9 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...

机构

19 篇 natl univ irelan...
18 篇 brown univ provi...
14 篇 univ connecticut...
14 篇 cork constraint ...
10 篇 cork constraint ...
8 篇 univ oxford comp...
7 篇 natl univ irelan...
7 篇 natl univ irelan...
7 篇 department of me...
6 篇 nicta nsw
6 篇 161 rue ada mont...
6 篇 natl univ singap...
6 篇 univ st andrews ...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 ben gurion univ ...
5 篇 brown univ dept ...
5 篇 department of co...

作者

29 篇 stuckey peter j.
29 篇 o'sullivan barry
22 篇 van hentenryck p...
19 篇 freuder eugene c...
18 篇 walsh toby
17 篇 quimper claude-g...
16 篇 miguel ian
16 篇 michel laurent
15 篇 smith barbara m.
14 篇 régin jean-charl...
14 篇 bessiere christi...
14 篇 schaus pierre
13 篇 gent ian p.
13 篇 beldiceanu nicol...
13 篇 schulte christia...
13 篇 pesant gilles
12 篇 beck j. christop...
11 篇 hebrard emmanuel
10 篇 hnich brahim
10 篇 nightingale pete...

语言

1,073 篇 英文
3 篇 中文

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

共 1076 条记录，以下是321-330 订阅

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

详细简洁

排序：

On the Reduction of the CSP Dichotomy Conjecture to Digraphs

On the Reduction of the CSP Dichotomy Conjecture to Digraphs

引用

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

作者： Bulin, Jakub Delic, Dejan Jackson, Marcel Niven, Todd Charles Univ Prague Fac Math & Phys Prague Czech Republic Ryerson Univ Dept Math Toronto ON Canada La Trobe Univ Dept Math Melbourne Vic Australia

ISBN: (纸本)9783642406263;9783642406270

It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective constraint Optimization with Tradeoffs

Multi-Objective Constraint Optimization with Tradeoffs

引用

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

作者： Marinescu, Radu Razak, Abdul Wilson, Nic IBM Research Ireland Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642406263;9783642406270

In this paper, we consider the extension of multi-objective constraint optimization algorithms to the case where there are additional tradeoffs, reducing the number of optimal solutions. We focus especially on branch-and-bound algorithms which use a mini-buckets algorithm for generating the upper bound at each node (in the context of maximizing values of objectives). Since the main bottleneck of these algorithms is the very large size of the guiding upper bound sets we introduce efficient methods for reducing these sets, yet still maintaining the upper bound property. We also propose much faster dominance checks with respect to the preference relation induced by the tradeoffs. Furthermore, we show that our tradeoffs approach which is based on a preference inference technique can also be given an alternative semantics based on the well known Multi-Attribute Utility theory. Our comprehensive experimental results on common multi-objective constraint optimization benchmarks demonstrate that the proposed enhancements allow the algorithms to scale up to much larger problems than before.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

the Berth Allocation and Quay Crane Assignment Problem Using a CP Approach

The Berth Allocation and Quay Crane Assignment Problem Using...

引用

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

作者： Zampelli, Stephane Vergados, Yannis Van Schaeren, Rowan Dullaert, Wout Raa, Birger Dynam Decis Technol Providence RI 02902 USA Brown Univ Providence RI 02912 USA Antwerp Maritime Acad Antwerp Belgium Free Univ Amsterdam Dept Informat & Logist & Innovat NL-1081 HV Amsterdam Netherlands Univ Antwerp Inst Transport & Maritime Management Antwerp Antwerp Belgium Univ Ghent B-9000 Ghent Belgium

ISBN: (纸本)9783642406263;9783642406270

this paper considers the combination of berth and crane allocation problems in container terminals. We propose a novel approach based on constraint programming which is able to model many realistic operational constraints. the costs for berth allocation, crane allocation, time windows, breaks and transition times during gang movements are optimized simultaneously. the model is based on a resource view where gangs are consumed by vessel activities. Side constraints are added independently around this core model. the model is richer than the state of the art in the operations research community. Experiments show that the model produces solutions with a cost gap of 1/10 (7,8%) to 1/5 (18,8%) compared to an ideal operational setting where operational constraints are ignored.

关键词： berth allocation crane assignment containers terminal constraint programming

来源：评论

学校读者我要写书评

暂无评论

Dominance Driven Search

Dominance Driven Search

引用

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

作者： Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

Recently, a generic method for identifying and exploiting dominance relations using dominance breaking constraints was proposed. In this method, sufficient conditions for a solution to be dominated are identified and these conditions are used to generate dominance breaking constraints which prune off the dominated solutions. We propose to use these dominance relations in a different way in order to boost the search for good/optimal solutions. In the new method, which we call dominance jumping, when search reaches a point where all solutions in the current domain are dominated, rather than simply backtrack as in the original dominance breaking method, we jump to the subtree which dominates the current subtree. this new strategy allows the solver to move from a bad subtree to a good one, significantly increasing the speed with which good solutions can be found. Experiments across a range of problems show that the method can be very effective when the original search strategy was not very good at finding good solutions.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

ASP with non-herbrand partial functions: a language and system for practical use

ASP with non-herbrand partial functions: a language and syst...

引用

29th international conference on Logic programming ICLP

作者： Balduccini, Marcello Eastman Kodak Co Rochester NY 14650 USA

Dealing with domains involving substantial quantitative information in Answer Set programming (ASP) often results in cumbersome and inefficient encodings. Hybrid "CASP" languages combining ASP and constraint programming aim to overcome this limitation, but also impose inconvenient constraints - first and foremost that quantitative information must be encoded by means of total functions. this goes against central knowledge representation principles that contribute to the power of ASP, and makes the formalization of certain domains difficult. ASP{f} is being developed with the ultimate goal of providing scientists and practitioners with an alternative to CASP languages that allows for the efficient representation of qualitative and quantitative information in ASP without restricting one's ability to deal with incompleteness or uncertainty. In this paper we present the latest outcome of such research: versions of the language and of the supporting system that allow for practical, industrial-size use and scalability. the applicability of ASP{f} is demonstrated by a case study on an actual industrial application.

关键词： Answer Set programming non-herbrand functions constraint answer set programming practical applications

来源：评论

学校读者我要写书评

暂无评论

Global Inverse Consistency for Interactive constraint Satisfaction

Global Inverse Consistency for Interactive Constraint Satisf...

引用

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

作者： Bessiere, Christian Fargier, Helene Lecoutre, Christophe Univ Montpellier LIRMM CNRS Montpellier France Univ Toulouse CNRS IRIT Toulouse France Univ Artois CNRS CRIL Lens France

ISBN: (纸本)9783642406263;9783642406270

Some applications require the interactive resolution of a constraint problem by a human user. In such cases, it is highly desirable that the person who interactively solves the problem is not given the choice to select values that do not lead to solutions. We call this property global inverse consistency. Existing systems simulate this either by maintaining arc consistency after each assignment performed by the user or by compiling offline the problem as a multi-valued decision diagram. In this paper, we define several questions related to global inverse consistency and analyse their complexity. Despite their theoretical intractability, we propose several algorithms for enforcing global inverse consistency and we show that the best version is efficient enough to be used in an interactive setting on several configuration and design problems. We finally extend our contribution to the inverse consistency of tuples.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Blowing Holes in Various Aspects of Computational Problems, with Applications to constraint Satisfaction

Blowing Holes in Various Aspects of Computational Problems, ...

引用

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

作者： Jonsson, Peter Lagerkvist, Victor Nordh, Gustav Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

We consider methods for constructing NP-intermediate problems under the assumption that P not equal NP. We generalize Ladner9;s original method for obtaining NP-intermediate problems by using parameters with variou... 详细信息

ISBN: (纸本)9783642406263;9783642406270

We consider methods for constructing NP-intermediate problems under the assumption that P not equal NP. We generalize Ladner's original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-intermediate subproblems for a broad and natural class of parameterizations, and extend the result further such that structural CSP restrictions based on parameters that are hard to compute (such as tree-width) are covered. Hereby we generalize a result by Grohe on width parameters and NP-intermediate problems. For studying certain classes of problems, including CSPs parameterized by constraint languages, we consider more powerful parameterizations. First, we identify a new method for obtaining constraint languages G such that CSP(G) are NP-intermediate. the sets G can have very different properties compared to previous constructions (by, for instance, Bodirsky & Grohe) and provides insights into the algebraic approach for studying the complexity of infinite-domain CSPs. Second, we prove that the propositional abduction problem parameterized by constraint languages admits NP-intermediate problems. this settles an open question posed by Nordh & Zanuttini.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Automated Symmetry Breaking and Model Selection in CONJURE

Automated Symmetry Breaking and Model Selection in CONJURE

引用

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

作者： Akgun, Ozgur Frisch, Alan M. Gent, Ian P. Hussain, Bilal Syed Jefferson, Christopher Kotthoff, Lars Miguel, Ian Nightingale, Peter Univ St Andrews St Andrews KY16 9AJ Fife Scotland Univ York York YO10 5DD N Yorkshire England Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783642406263;9783642406270

constraint modelling is widely recognised as a key bottleneck in applying constraint solving to a problem of interest. the CONJURE automated constraint modelling system addresses this problem by automatically refining constraint models from problem specifications written in the ESSENCE language. ESSENCE provides familiar mathematical concepts like sets, functions and relations nested to any depth. To date, CONJURE has been able to produce a set of alternative model kernels (i.e. without advanced features such as symmetry breaking or implied constraints) for a given specification. the first contribution of this paper is a method by which CONJURE can break symmetry in a model as it is introduced by the modelling process. this works at the problem class level, rather than just individual instances, and does not require an expensive detection step after the model has been formulated. this allows CONJURE to produce a higher quality set of models. A further limitation of CONJURE has been the lack of a mechanism to select among the models it produces. the second contribution of this paper is to present two such mechanisms, allowing effective models to be chosen automatically.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Atom Mapping with constraint programming

Atom Mapping with Constraint Programming

引用

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

作者： Mann, Martin Nahar, Feras Ekker, Heinz Backofen, Rolf Stadler, Peter F. Flamm, Christoph Univ Freiburg Dept Comp Sci Bioinformat George Kohler Allee 106 D-79106 Freiburg Germany Univ Freiburg BIOSS D-79001 Freiburg Germany Univ Freiburg ZBSA D-79001 Freiburg Germany Univ Copenhagen Ctr Noncoding RNA Technol & Hlth DK-1168 Copenhagen Denmark Univ Vienna Inst Theoret Chem A-1090 Vienna Austria Univ Leipzig Interdisciplinary Ctr Bioinformat Dept Comp Sci Bioinformat Grp D-04107 Leipzig Germany Max Planck Inst Math Sci D-04103 Leipzig Germany Fraunhofer Inst Cell Therapy & Immunol D-04103 Leipzig Germany Santa Fe Inst Santa Fe NM 87501 USA

ISBN: (纸本)9783642406263;9783642406270

Chemical reactions consist of a rearrangement of bonds so that each atom in an educt molecule appears again in a specific position of a reaction product. In general this bijection between educt and product atoms is not reported by chemical reaction databases, leaving the Atom Mapping Problem as an important computational task for many practical applications in computational chemistry and systems biology. Elementary chemical reactions feature a cyclic imaginary transition state (ITS) that imposes additional restrictions on the bijection between educt and product atoms that are not taken into account by previous approaches. We demonstrate that constraint programming is well-suited to solving the Atom Mapping Problem in this setting. the performance of our approach is evaluated for a subset of chemical reactions from the KEGG database featuring various ITS cycle layouts and reaction mechanisms.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：