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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

956 篇 会议
51 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

853 篇 工学
- 833 篇 计算机科学与技术...
- 495 篇 软件工程
- 41 篇 信息与通信工程
- 27 篇 电气工程
- 17 篇 控制科学与工程
- 8 篇 机械工程
- 7 篇 土木工程
- 6 篇 建筑学
- 6 篇 化学工程与技术
- 5 篇 材料科学与工程（可...
- 5 篇 农业工程
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 4 篇 生物工程
- 3 篇 冶金工程
- 3 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 航空宇航科学与技...
530 篇 理学
- 422 篇 数学
- 274 篇 系统科学
- 18 篇 统计学（可授理学、...
- 10 篇 物理学
- 7 篇 生物学
- 6 篇 化学
62 篇 管理学
- 54 篇 管理科学与工程(可...
- 34 篇 工商管理
- 10 篇 图书情报与档案管...
7 篇 法学
- 7 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 农学
- 5 篇 作物学
1 篇 教育学
1 篇 医学
1 篇 军事学

主题

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

机构

18 篇 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 篇 natl univ singap...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 161 rue ada mont...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 univ st andrews ...
5 篇 ben gurion univ ...
5 篇 department of co...
5 篇 univ coll cork c...

作者

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

语言

1,023 篇 英文
3 篇 中文

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

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

To Encode or to Propagate? the Best Choice for Each constraint in SAT

To Encode or to Propagate? The Best Choice for Each Constrai...

引用

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

作者： Abio, Ignasi Nieuwenhuis, Robert Oliveras, Albert Rodriguez-Carbonell, Enric Stuckey, Peter J. Tech Univ Dresden Theoret Comp Sci Dresden Germany Tech Univ Catalonia Barcelona Spain Natl ICT Australia Sydney NSW Australia Univ Melbourne Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

Sophisticated compact SAT encodings exist for many types of constraints. Alternatively, for instances with many (or large) constraints, the SAT solver can also be extended with built-in propagators (the SAT Modulo theories approach, SMT). For example, given a cardinality constraint x(1) + ... + x(n) <= k, as soon as k variables become true, such a propagator can set the remaining variables to false, generating a so-called explanation clause of the form x(1) boolean AND ... boolean AND x(k) -> (x(i)) over bar. But certain "bottle-neck" constraints end up generating an exponential number of explanations, equivalent to a naive SAT encoding, much worse than using a compact encoding with auxiliary variables from the beginning. therefore, Abio and Stuckey proposed starting off with a full SMT approach and partially encoding, on the fly, only certain "active" parts of constraints. Here we build upon their work. Equipping our solvers with some additional bookkeeping to monitor constraint activity has allowed us to shed light on the effectiveness of SMT: many constraints generate very few, or few different, explanations. We also give strong experimental evidence showing that it is typically unnecessary to consider partial encodings: it is competitive to encode the few really active constraints entirely. this makes the approach amenable to any kind of constraint, not just the ones for which partial encodings are known.

关键词： Bottles

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

constraints in Software Testing, Verification and Analysis CSTVA 2013

Constraints in Software Testing, Verification and Analysis C...

引用

6th IEEE international conference on Software Testing, Verification and Validation (ICST)

作者： Cadar, Cristian Dadeau, Frederic Univ London Imperial Coll Sci Technol & Med South Kensington Campus London SW7 2AZ England INRIA CASSIS FEMTO ST Inst F-25030 Besancon France

ISBN: (纸本)9780769549934;9781479913244

Recent years have seen an increasing interest in the application of constraint solving techniques to test, verify and analyze software systems. A significant body of constraint-based techniques has been proposed and investigated in the context of test input generation, model-based testing, symbolic execution, static analysis, program verification, and many other areas. these techniques use or extend constraint solvers such as SAT and SMT solvers to reason about boolean, integer, real and floating-point data types, as well as complex data structures, control structures, method calls and other program features. the constraint systems that result from this work usually share many common features and are relevant to a variety of application domains. Following a first meeting held with the principles and practice of constraint programming (CP) conference in 2006, and three subsequent meetings at the international conference on Software Testing, Verification and Validation (ICST) in 2010, 2011 and 2012, the aim of this paper is to bring together researchers and practitioners working in constraint-based software testing, verification and analysis, to investigate future developments in this research field.

关键词： constraint handling formal verification program testing

来源：评论

学校读者我要写书评

暂无评论

Tractable combinations of global constraints

Tractable combinations of global constraints

引用

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

作者： Cohen, David A. Jeavons, Peter G. thorstensen, Evgenij Živný, Stanislav Department of Computer Science Royal Holloway University of London United Kingdom Department of Computer Science University of Oxford United Kingdom Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9783642406263

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structural restrictions with the observation that some important types of global constraint do not distinguish between large classes of equivalent solutions. © 2013 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Improving WPM2 for (weighted) partial MaxSAT

Improving WPM2 for (weighted) partial MaxSAT

引用

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

作者： Ansótegui, Carlos Bonet, Maria Luisa Gabàs, Joel Levy, Jordi DIEI Univ. de Lleida Spain LSI UPC Spain IIIA-CSIC Spain

ISBN: (纸本)9783642406263

Weighted Partial MaxSAT (WPMS) is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into WPMS. In this paper we extend the state-of-the-art WPM2 algorithm by adding several improvements, and implement it on top of an SMT solver. In particular, we show that by focusing search on solving to optimality subformulas of the original WPMS instance we increase the efficiency of WPM2. From the experimental evaluation we conducted on the PMS and WPMS instances at the 2012 MaxSAT Evaluation, we can conclude that the new approach is both the best performing for industrial instances, and for the union of industrial and crafted instances. © 2013 Springer-Verlag.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Globalizing constraint models

Globalizing constraint models

引用

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

作者： Leo, Kevin Mears, Christopher Tack, Guido Garcia De La Banda, Maria Faculty of IT Monash University Australia Victoria Laboratory Australia

ISBN: (纸本)9783642406263

We present a method that, given a constraint model, suggests global constraints to replace parts of it. this helps non-expert users to write higher-level models that are easier to reason about and may result in better solving performance. Our method exploits the structure of the model by considering combinations of the constraints, collections of variables, parameters and loops already present in the model, as well as parameter data from several data files. We assign a score to a candidate global constraint by comparing a sample of its solution space with that of the part of the model it is intended to replace. the top-scoring global constraints are presented to the user through an interactive display, which shows how they could be incorporated into the model. the MiniZinc Globalizer, our implementation of the method for the MiniZinc modelling language, is available on the web. © 2013 Springer-Verlag.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：