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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

68 篇 会议
4 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

66 篇 工学
- 64 篇 计算机科学与技术...
- 52 篇 软件工程
- 1 篇 动力工程及工程热...
- 1 篇 信息与通信工程
- 1 篇 环境科学与工程（可...
17 篇 理学
- 14 篇 系统科学
- 9 篇 数学
- 1 篇 统计学（可授理学、...
3 篇 管理学
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...

主题

18 篇 constraint theor...
10 篇 constraint satis...
3 篇 mathematical log...
3 篇 programming tech...
3 篇 programming lang...
3 篇 constraint progr...
3 篇 logics and meani...
3 篇 regular constrai...
2 篇 solution countin...
2 篇 model-driven vis...
2 篇 problem solving
2 篇 modeling languag...
2 篇 alldifferent con...
2 篇 constraint optim...
2 篇 semantics
2 篇 constraint-based...
2 篇 optimization alg...
2 篇 heuristic search
1 篇 traveling salesm...
1 篇 genetic programm...

机构

4 篇 natl univ irelan...
4 篇 kth royal inst t...
3 篇 univ connecticut...
3 篇 brown univ provi...
2 篇 univ bologna dei...
2 篇 univ cote azur c...
2 篇 nicta nsw
2 篇 ecole polytech m...
2 篇 univ nottingham ...
2 篇 intel corp haifa
2 篇 univ coll cork c...
2 篇 cornell univ dep...
2 篇 ecole polytech d...
2 篇 univ oxford comp...
2 篇 brown univ dept ...
2 篇 natl univ irelan...
1 篇 inra toulouse
1 篇 university of ne...
1 篇 ecole polytech f...
1 篇 cnrs fre 2499 ru...

作者

5 篇 stuckey peter j.
5 篇 o'sullivan barry
4 篇 van hentenryck p...
4 篇 bessiere christi...
4 篇 hebrard emmanuel
4 篇 lecoutre christo...
4 篇 schulte christia...
4 篇 pesant gilles
3 篇 zanarini alessan...
3 篇 michel laurent
3 篇 milano michela
2 篇 prestwich steven
2 篇 miguel ian
2 篇 hnich brahim
2 篇 tarim s. armagan
2 篇 gent ian p.
2 篇 rossi roberto
2 篇 beldiceanu nicol...
2 篇 lombardi michele
2 篇 meseguer pedro

语言

75 篇 英文

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

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

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

详细简洁

排序：

Closing the Open Shop: Contradicting Conventional Wisdom

Closing the Open Shop: Contradicting Conventional Wisdom

引用

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

作者： Grimes, Diarmuid Hebrard, Emmanuel Malapert, Arnaud Cork Constraint Computat Ctr Cork Ireland Cirrelt CNRS EMN LINA UMR 6241 Montreal PQ Canada

ISBN: (纸本)9783642042430

this paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused oil developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such domain specific models. We introduce a simple constraint model that combines a generic adaptive heuristic with naive propagation, and show that it often outperforms state-of-the-art solvers for both open shop and job shop problems.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Snake Lex: An Alternative to Double Lex

Snake Lex: An Alternative to Double Lex

引用

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

作者： Grayland, Andrew Miguel, Ian Roney-Dougal, Colva M. Sch Comp Sci St Andrews Fife Scotland Sch Math & Stat St Andrews Fife Scotland

ISBN: (纸本)9783642042430

Complete row and column symmetry breaking in constraint models using the lex leader method is generally prohibitively costly. Double lex, which is derived from lex leader, is commonly used in practice as all incomplete symmetry-breaking method for row and column symmetries. Double lex is based on a row-wise canonical variable ordering. However, this choice is arbitrary. We investigate other canonical orderings and focus on one in particular: snake ordering. From this we derive a corresponding incomplete set of symmetry breaking constraints, snake lex. Experimental data comparing double lex and snake lex shows that snake lex is Substantially better than double lex in in many cases.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Evolving Parameterised Policies for Stochastic constraint programming

Evolving Parameterised Policies for Stochastic Constraint Pr...

引用

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

作者： Prestwich, Steven Tarim, S. Armagan Rossi, Roberto Hnich, Brahim Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland Univ Nottingham Operat Management Div Nottingham England Wageningen Univ Logist Decis & Informat Sci Grp Wageningen Netherlands Izmir Univ Econom Fac Comp Sci Izmir Turkey

ISBN: (纸本)9783642042430

Stochastic constraint programming is an extension of constraint programming for modelling and solving combinatorial problems involving uncertainty. A solution to such a problem is a policy tree that specifies decision variable assignments in each scenario. Several Solution methods have been proposed but none seems practical for large multi-stage problems. We propose all incomplete approach: specifying a policy tree indirectly by a parameterised function, whose parameter values are found by evolutionary search. On some problems this method is orders of magnitude faster than a state-of-the-art scenario-based approach, and it also provides a very compact representation of policy trees.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Efficient Generic Search Heuristics within the EMBP Framework

Efficient Generic Search Heuristics within the EMBP Framewor...

引用

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

作者： Le Bras, Ronan Zanarini, Alessandro Pesant, Gilles Ecole Polytech Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9783642042430

Accurately estimating the distribution of solutions to a problem, should such solutions exist, provides efficient search heuristics. the purpose of this paper is to propose new ways of computing such estimates, with different degrees of accuracy and complexity. We build oil the Expectation-Maximizatiou Belief-Propagation (EMPB) framework proposed by Hsu et al. to solve constraint Satisfaction Problems (CSPs). We propose two general approaches within the EMBP framework: we firstly derive update rules at;the constraint level while enforcing domain consistency and then derive update rules globally, at the problem level. the contribution of this paper is two-fold: first, we derive new generic update rules suited to tackle ally CSP;second, we propose all efficient EMP-inspired approach, thereby improving this method and making it competitive with the state of the art. We evaluate these approaches experimentally and demonstrate their effectiveness.

关键词： constraint Satisfaction Search Heuristics Probabilistic Reasoning Expectation Maximization Belief Propagation

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Filtering Algorithms for Global Chance-constraints

Synthesizing Filtering Algorithms for Global Chance-Constrai...

引用

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

作者： Hnich, Brahim Rossi, Roberto Tarim, S. Armagan Prestwich, Steven Izmir Univ Econ Fac Comp Sci Izmir Turkey Univ Wageningen & Res Ctr Logist Decis & Informat Sci Wageningen Netherlands Univ Nottingham Operat Management Div Nottingham England Univ Coll Cork Ireland Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783642042430

Stochastic constraint Satisfaction Problems (SCSPs) are a powerful modeling framework for problems under uncertainty. To solve them is a P-Space task. the only solution approach to date compiles down SCSPs into classical CSPs. this allows the rouse of classical constraint solvers to solve SCSPs, but at the cost of increased space requirements and weak constraint propagation. this paper tries to overcome some of these drawbacks by automatically synthesizing filtering algorithms for global chance-constraints. these filtering algorithms are parameterized by propagators for the deterministic version of the chance-constraints. this approach allows the rouse of existing propagators in current, constraint solvers and it enhances constraint propagation. Experiments show the benefits of this novel approach.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Compiling All Possible Conflicts of a CSP

Compiling All Possible Conflicts of a CSP

引用

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

作者： Papadopoulos, Alexandre O'Sullivan, Barry Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Dept Comp Sci Cork Ireland

ISBN: (纸本)9783642042430

In interactive decision-making settings, such as product configuration, users are stating preferences, or foreground constraints, over a set of possible solutions, as defined by background constraints. When the foreground constraints introduce inconsistencies with the background constraints, we wish to find explanations that help the user converge to a solution. In order to provide satisfactory explanations, it call be useful to know one or several subsets of conflicting constraints;Such a subset is called a conflict. When computing such conflicts is intractable in an interactive context, we call choose to compile the problem so as to allow faster response times. In this paper we propose a new representation, which implicitly encompasses all conflicts possibly introduced by a user's choices. We claim that it call help in Situations where extra information about conflicts is needed, such as when explanations of inconsistency are required.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Realtime Online Solving of Quantified CSPs

Realtime Online Solving of Quantified CSPs

引用

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

作者： Stynes, David Brown, Kenneth N. Univ Coll Cork Dept Comp Sci Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783642042430

We define Realtime Online solving of Quantified constraint Satisfaction Problems (QCSPs) as a, model for realtime online CSP solving. We use a combination of propagation, lookahead and heuristics and show how all three improve performance. For adversarial opponents we show that we can achieve promising results through good lookahead and heuristics and that a version of alpha beta pruning performs strongly. For random opponents, we show that we can frequently achieve solutions even on problems which lack a winning strategy and that. we can improve our success rate by using Existential Quantified Generalised Arc Consistency;a, lower level of consistency than SQGAC, to maximise pruning without removing solutions. We also consider the power of the universal opponent and show that through good heuristic selection we can generate a significantly stronger player than a static heuristic provides.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Maintaining State in Propagation Solvers

Maintaining State in Propagation Solvers

引用

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

作者： Reischuk, Raphael M. Schulte, Christian Stuckey, Peter J. Tack, Guido Univ Saarland IS&C D-6600 Saarbrucken Germany KTH Royal Inst Technol Stockholm Sweden Univ Melbourne Natl ICT Australia Dept Comp Sci & Software Engn Victoria Lab Melbourne Vic Australia Univ Saarland PS Lab Saarbrucken Germany

ISBN: (纸本)9783642042430

constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. the solver state is modified during propagation. But search requires the solver to return to a previous state. Hence a, propagation solver must determine how to maintain state during propagation and forward and backward search. this paper sets out the possible ways in which a propagation solver call choose to maintain state, and the restrictions that such choices place on the resulting system. Experiments illustrate the result of various choices for the three principle state components of a solver: variables, propagators, and dependencies between them. this paper also provides the first realistic comparison of trailing versus copying for state restoration.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Filtering Numerical CSPs Using Well-Constrained Subsystems

Filtering Numerical CSPs Using Well-Constrained Subsystems

引用

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

作者： Araya, Ignacio Trombettoni, Gilles Neveu, Bertrand Univ Nice Sophia CERTIS INRIA Nice France

ISBN: (纸本)9783642042430

When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-constrained, interval Newton algorithms behave like a. global constrain over the whole n x n system. Also, filtering algorithms issued from constrahit programming perform an AC3-like propagation loop, where the constraints are iteratively handled one by one by a revise procedure. Applying a revise procedure amounts in contracting a 1 x 1 subsystem. this paper investigates the possibility of defining contracting well-constrained subsystems of size k (1 <= k <= n). We theoretically define the Box-k-consistency as a generalization of the state-of-the-art Box-consistency. Well-constrained subsystems act as global constraints that can bring additional filtering w.r.t. interval Newton and 1 x 1 standard subsystems. Also, the filtering performed inside a subsystem allows the solving process to learn interesting multi-dimensional branching points;i.e., to bisect several variable domains simultaneously. Experiments highlight gains in cpU time w.r.t. state-of-the-art algorithms oil decomposed and structured systems.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Memoisation for constraint-based local search

Memoisation for constraint-based local search

引用

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

作者： Ågren, Magnus Swedish Institute of Computer Science Box 1263 Kista SE 164 29 Sweden

ISBN: (纸本)3642042430

We present a memoisation technique for constraint-based local search based on the observation that penalties with respect to some interchangeable elements need only be calculated once. We apply the technique to constraint-based local search on set variables, and demonstrate the usefulness of the approach by significantly speeding up the penalty calculation of a commonly used set constraint. © 2009 Springer Berlin Heidelberg.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：