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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

36 篇 会议
2 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

27 篇 理学
- 21 篇 数学
- 18 篇 系统科学
- 1 篇 统计学（可授理学、...
25 篇 工学
- 24 篇 计算机科学与技术...
- 16 篇 软件工程
- 2 篇 信息与通信工程
- 1 篇 电气工程
- 1 篇 农业工程
1 篇 法学
- 1 篇 社会学
1 篇 农学
- 1 篇 作物学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

11 篇 constraint satis...
10 篇 constraint theor...
2 篇 directed graphs
1 篇 hierarchical sys...
1 篇 constraint gener...
1 篇 weighted clones
1 篇 motion planning
1 篇 least core
1 篇 discrete optimiz...
1 篇 soft neighborhoo...
1 篇 constrained opti...
1 篇 constraint handl...
1 篇 logic programmin...
1 篇 weighted constra...
1 篇 mathematical log...
1 篇 propagator
1 篇 tsp
1 篇 global constrain...
1 篇 constraint satis...
1 篇 program testing

机构

2 篇 cork constraint ...
2 篇 mines de nantes
2 篇 chinese univ hon...
2 篇 cork constraint ...
1 篇 computer and aut...
1 篇 univ autonoma ba...
1 篇 microsoft resear...
1 篇 i3s umr 6070 cnr...
1 篇 algorithms and c...
1 篇 sics kista 16429
1 篇 irit university ...
1 篇 department of co...
1 篇 univ paris est f...
1 篇 lausanne ch-1015
1 篇 ryerson univ dep...
1 篇 nicta university...
1 篇 natl inst inform...
1 篇 national institu...
1 篇 univ wyoming dep...
1 篇 cnrs inria tasc ...

作者

4 篇 beldiceanu nicol...
3 篇 pearson justin
3 篇 flener pierre
3 篇 o'sullivan barry
2 篇 jackson marcel
2 篇 niven todd
2 篇 lee jimmy h. m.
2 篇 petit thierry
2 篇 yokoo makoto
2 篇 iwasaki atsushi
1 篇 prestwich steven...
1 篇 isoart nicolas
1 篇 mears christophe...
1 篇 cadar cristian
1 篇 he jun
1 篇 vilím petr
1 篇 cooper martin
1 篇 wallace mark
1 篇 zhang wei ming
1 篇 wilson nic

语言

39 篇 英文

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

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

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

详细简洁

排序：

Filtering algorithms for discrete cumulative problems with overloads of resource

Filtering algorithms for discrete cumulative problems with o...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： De Clercq, Alexis Petit, thierry Beldiceanu, Nicolas Jussien, Narendra École des Mines de Nantes LINA UMR CNRS 6241 4 rue Alfred Kastler NantesFR-44307 France

ISBN: (纸本)9783642237850

Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. Moreover, this capacity is not necessarily always the same during the scheduling period. this article introduces a new constraint for solving this class of problems. We adapt two filtering algorithms to our context: Sweep and P. Vilím’s Edge-Finding algorithm. We emphasize that in some problems violations are imposed. We design a new filtering procedure specific to this kind of events. We introduce a search heuristic specific to our constraint. We successfully experiment our constraint. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Pruning rules for constrained optimisation for conditional preferences

Pruning rules for constrained optimisation for conditional p...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Wilson, Nic Trabelsi, Walid Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642237850

A depth-first search algorithm can be used to find optimal solutions of a constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a cp-net). this involves checking at each leaf node if the corresponding solution of the CSP is dominated by any of the optimal solutions found so far;if not, then we add this solution to the set of optimal solutions. this kind of algorithm can clearly be computationally expensive if the number of solutions is large. At a node N of the search tree, with associated assignment b to a subset of the variables B, it may happen that, for some previously found solution α, either (a) α dominates all extensions of b;or (b) α does not dominate any extension of a. the algorithm can be significantly improved if we can find sufficient conditions for (a) and (b) that can be efficiently checked. In case (a), we can backtrack since we need not continue the search below N;in case (b), α does not need to be considered in any node below the current node N. We derive a sufficient condition for (b), and three sufficient conditions for (a). Our experimental testing indicates that this can make a major difference to the efficiency of constrained optimisation for conditional preference theories including cp-nets. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Proving symmetries by model transformation

Proving symmetries by model transformation

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Mears, Christopher Niven, Todd Jackson, Marcel Wallace, Mark Faculty of IT Monash University Australia Department of Mathematics La Trobe University Australia

ISBN: (纸本)9783642237850

the presence of symmetries in a constraint satisfaction problem gives an opportunity for more efficient search. Within the class of matrix models, we show that the problem of deciding whether some well known permutations are model symmetries (solution symmetries on every instance) is undecidable. We then provide a new approach to proving the model symmetries by way of model transformations. Given a model M and a candidate symmetry σ, the approach first syntactically applies σ to M and then shows that the resulting model σ(M) is semantically equivalent to M. We demonstrate this approach with an implementation that reduces equivalence to a sentence in Presburger arithmetic, using the modelling language MiniZinc and the term re-writing language Cadmium, and show that it is capable of proving common symmetries in models. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Value ordering for finding all solutions: Interactions with adaptive variable ordering

Value ordering for finding all solutions: Interactions with ...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Mehta, Deepak O’Sullivan, Barry Quesada, Luis Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642237850

We consider the impact of value ordering heuristics on the search effort required to find all solutions, or proving none exist, to a constraint satisfaction problem in k-way branching search. We show that when the variable ordering heuristic is adaptive, the order in which the values are assigned to variables can make a significant difference in all measures of search effort. We study in depth an open issue regarding the relative merit of traditional value heuristics, and their complements, when searching for all solutions. We also introduce a lazy version of k-way branching and study the effect of value orderings on finding all solutions when it is used. this paper motivates a new and fruitful line of research in the study of value ordering heuristics for proving unsatisfiability. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Completable partial solutions in constraint programming and constraint-based scheduling

引用

10th international conference on the principles and practice of constraint programming

作者： Kovács, A Váncza, J Budapest University of Technology and Economics Magyar tudósok körútja 2/d Budapest1117 Hungary Computer and Automation Research Institute Kende utca 13-17 Budapest1111 Hungary

ISBN: (纸本)3540232419

the paper introduces the notion of freely completable partial solutions to characterize constraint satisfaction problems that have components which are relatively easy to solve and are only loosely connected to the remaining parts of the problem. Discovering such partial solutions during the solution process can result in strongly pruned search trees. We give a general definition of freely completable partial solutions, and then apply it to resource-constrained project scheduling. In this domain, we suggest a heuristic algorithm that is able to construct freely completable partial schedules. the method – together with symmetry breaking applied before search – has been successfully tested on real-life resource-constrained project scheduling problems containing up to 2000 tasks.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Towards inductive constraint solving 1

引用

7th international conference on principles and practice of constraint programming, cp 2001

作者： Abdennadher, Slim Rigotti, Christophe Computer Science Department University of Munich Oettingenstr. 67 München80538 Germany Laboratoire d’Ingénierie des Systèmes d’Information Bâtiment 501 INSA Lyon Villeurbanne Cedex69621 France

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules [5,17,3] and simplification rules [4] for constraints defined over finite domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. this approach can be seen as a concrete step towards Inductive constraint Solving. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Computing a Payoff Division in the Least Core for MC-nets Coalitional Games 1

引用

17th international conference on principles and practice of Multi-Agent Systems (PRIMA)

作者： Hirayama, Katsutoshi Hanada, Kenta Ueda, Suguru Yokoo, Makoto Iwasaki, Atsushi Kobe Univ Kobe Hyogo Japan Natl Inst Informat Kumamoto Japan Kyushu Univ Fukuoka Japan Univ Elect Commnunicat Tokyo Japan

ISBN: (数字)9783319131917

ISBN: (纸本)9783319131917;9783319131900

MC-nets is a concise representation of the characteristic functions that exploits a set of rules to compute payoffs. Given a MC-nets instance, the problem of computing a payoff division in the least core, which is a generalization of the core-non-emptiness problem that is known to be coNP-complete, is definitely a hard computational problem. In fact, to the best of our knowledge, no algorithm can actually compute such a payoff division for MC-nets instances with dozens of agents. We propose a new algorithm for this problem, that exploits the constraint generation technique to solve the linear programming problem that potentially has a huge number of constraints. Our experimental results are striking since, using 8 GB memory, our proposed algorithm can successfully compute a payoff division in the least core for the instances with up to 100 agents, but the naive algorithm fails due to a lack of memory for instances with 30 or more agents.

关键词： coalitional games least core MC-nets constraint generation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：