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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

62 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 13 篇 软件工程
- 1 篇 电气工程
- 1 篇 交通运输工程
48 篇 理学
- 44 篇 数学
- 14 篇 系统科学
- 1 篇 统计学（可授理学、...
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

12 篇 constraint satis...
12 篇 constraint theor...
5 篇 computer program...
3 篇 linear programmi...
3 篇 constraint progr...
1 篇 bandit
1 篇 constraint logic...
1 篇 query languages
1 篇 inverse problems
1 篇 large neighborho...
1 篇 problem solving
1 篇 chaotic dynamica...
1 篇 modeling languag...
1 篇 adaptive search
1 篇 concolic testing
1 篇 soft neighborhoo...
1 篇 containers
1 篇 optimal systems
1 篇 redundancy
1 篇 iterative method...

机构

2 篇 cork constraint ...
2 篇 université côte ...
2 篇 univ coll cork c...
2 篇 univ melbourne m...
2 篇 faculty of elect...
1 篇 free univ amster...
1 篇 univ st andrews ...
1 篇 université côte ...
1 篇 univ nantes lina...
1 篇 tech univ catalo...
1 篇 nicta nsw
1 篇 univ melbourne n...
1 篇 antwerp maritime...
1 篇 univ melbourne d...
1 篇 ujf cnrs grenobl...
1 篇 univ york york y...
1 篇 univ artois cnrs...
1 篇 cnrs lirmm f-343...
1 篇 univ autonoma ba...
1 篇 algorithms and c...

作者

5 篇 stuckey peter j.
4 篇 régin jean-charl...
3 篇 pearson justin
3 篇 werner tomáš
3 篇 chu geoffrey
3 篇 dlask tomáš
3 篇 flener pierre
3 篇 o'sullivan barry
2 篇 prestwich steven...
2 篇 thorstensen evge...
2 篇 isoart nicolas
2 篇 miguel ian
2 篇 nightingale pete...
2 篇 gent ian p.
2 篇 de givry simon
2 篇 schaus pierre
1 篇 schoenauer marc
1 篇 prestwich steven
1 篇 fargier helene
1 篇 fontaine daniel

语言

63 篇 英文

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

共 63 条记录，以下是21-30 订阅

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

详细简洁

排序：

Selective Unification in constraint Logic programming 17

Selective Unification in Constraint Logic Programming

引用

19th international Symposium on principles and practice of Declarative programming (PPDP)

作者： Mesnard, Fred Payet, Etienne Vidal, German Univ Reunion LIM St Denis Reunion France Univ Politecn Valencia DSIC MiST Valencia Spain

ISBN: (纸本)9781450352918

Concolic testing is a well-known validation technique for imperative and object-oriented programs. We have recently introduced an adaptation of this technique to logic programming. At the heart of our framework for concolic testing lies a logic programming specific procedure that we call "selective unification". In this paper, we consider concolic testing in the context of constraint logic programming and extend the notion of selective unification accordingly. We prove that the selective unification problem is generally undecidable for constraint logic programs, and we present a correct and complete algorithm for selective unification in the context of a class of constraint structures.

关键词： constraint logic programming Concolic testing Unification

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

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

来源：评论

学校读者我要写书评

暂无评论

An abstract interpretation based combinator for modelling while loops in constraint programming

An abstract interpretation based combinator for modelling wh...

引用

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

作者： Denmat, Tristan Gotlieb, Arnaud Ducasse, Mireille INSA IRISA Campus Univ Beaulieu F-35042 Rennes France INRIA IRISA F-35042 Rennes France

ISBN: (纸本)9783540749691

We present the w constraint combinator that models while loops in constraint programming. Embedded in a finite domain constraint solver, it allows programmers to develop non-trivial arithmetical relations using loops, exactly as in an imperative language style. the deduction capabilities of this combinator come from abstract interpretation over the polyhedra abstract domain. this combinator has already demonstrated its utility in constraint- based verification and we argue that it also facilitates the rapid prototyping of arithmetic constraints (e.g. power, gcd or sum).

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming: Boolean constraint Solving for Knowledge Representation and Reasoning

Answer Set Programming: Boolean Constraint Solving for Knowl...

引用

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

作者： Schaub, Torsten Simon Fraser Univ Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642406263;9783642406270

Answer Set programming (ASP; [1,2,3]) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance Boolean constraint solving capacities. ASP is particularly suited for modeling problems in the area of Knowledge Representation and Reasoning involving incomplete, inconsistent, and changing information. As such, it offers, in addition to satisfiability testing, various reasoning modes, including different forms of model enumeration, intersection or unioning, as well as multi-criteria and -objective optimization. From a formal perspective, ASP allows for solving all search problems in NP (and NP NP ) in a uniform way. Hence, ASP is wellsuited for solving hard combinatorial search problems, like system design and timetabling. Prestigious applications of ASP include composition of Renaissance music [4], decision support systems for NASA shuttle controllers [5], reasoning tools in systems biology [6,7,8] and robotics [9,10], industrial team-building [11], and many more. the versatility of ASP is nicely reflected by the ASP solver clasp [12], winning first places at various solver competitions, such as ASP,MISC, PB, and SAT competitions. the solver clasp is at the heart of the open source platform Potassco hosted at *** . Potassco stands for the “Potsdam Answer Set Solving Collection-[13] and has seen more than 30000 downloads world-wide since its inception at the end of 2008. the talk will start with an introduction to ASP, its modeling language and solving methodology, and portray some distinguished ASP systems.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Dead-End Elimination for Weighted CSP

Dead-End Elimination for Weighted CSP

引用

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

作者： de Givry, Simon Prestwich, Steven D. O'Sullivan, Barry INRA UR 875 MIA T F-31320 Castanet Tolosan France Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783642406263;9783642406270

Soft neighborhood substitutability (SNS) is a powerful technique to automatically detect and prune dominated solutions in combinatorial optimization. Recently, it has been shown in [26] that enforcing partial SNS (PSNSr) during search can be worthwhile in the context of Weighted constraint Satisfaction Problems (WCSP). However, for some problems, especially with large domains, PSNSr is still too costly to enforce due to its worst-case time complexity in O(ned(4)) for binary WCSP. We present a simplified dominance breaking constraint, called restricted dead-end elimination (DEEr), the worst-case time complexity of which is in O(ned(2)). Dead-end elimination was introduced in the context of computational biology as a preprocessing technique to reduce the search space [13, 14, 16, 17, 28, 30]. Our restriction involves testing only one pair of values per variable instead of all the pairs, with the possibility to prune several values at the same time. We further improve the original dead-end elimination criterion, keeping the same time and space complexity as DEEr. Our results show that maintaining DEEr during a depth-first branch and bound (DFBB) search is often faster than maintaining PSNSr and always faster than or similar to DFBB alone.

关键词： combinatorial optimization dominance rule weighted constraint satisfaction problem soft neighborhood substitutability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Solving the agricultural land allocation problem by constraint-based local search

Solving the agricultural land allocation problem by constrai...

引用

19th international conference on principles and practice of constraint programming, cp 2013

作者： Bui, Quoc Trung Pham, Quang Dung Deville, Yves ICTEAM Université Catholique de Louvain Belgium SoICT Hanoi University of Science and Technology Viet Nam

ISBN: (纸本)9783642406263

Agricultural land allocation is a problem that exists in most provinces in Vietnam. Each household owns many disconnected parcels, which reduces agricultural development. the solution to the problem is to repartition this agricutural land among the households, while satisfying some criteria. Historically, this problem has been approached neither using optimization technology nor computer science. the present paper describes the formulation of the problem and proposes a constraint-based local search algorithm for solving it. Experimental results on real data in Dong Trung village show that the solution computed by our algorithm is better than traditional solutions. © 2013 Springer-Verlag.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Maintaining Soft Arc Consistencies in BnB-ADOPT⁺ during Search

Maintaining Soft Arc Consistencies in BnB-ADOPT<SUP>+</SUP> ...

引用

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

作者： Gutierrez, Patricia Lee, Jimmy H. M. Lei, Ka Man Mak, Terrence W. K. Meseguer, Pedro Univ Autonoma Barcelona IIIA CSIC Bellaterra 08193 Spain Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Peoples R China NICTA Victoria Lab Melbourne Vic 3010 Australia Univ Melbourne Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

Gutierrez and Meseguer show how to enforce consistency in BnB-ADOPT(+) for distributed constraint optimization, but they consider unconditional deletions only. However, during search, more values can be pruned conditionally according to variable instantiations that define subproblems. Enforcing consistency in these subproblems can cause further search space reduction. We introduce efficient methods to maintain soft arc consistencies in every subproblem during search, a non trivial task due to asynchronicity and induced overheads. Experimental results show substantial benefits on three different benchmarks.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：