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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

10 篇 工学
- 10 篇 计算机科学与技术...
- 10 篇 软件工程
- 1 篇 控制科学与工程
- 1 篇 环境科学与工程（可...
4 篇 理学
- 4 篇 系统科学
- 3 篇 数学
1 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

4 篇 problem solving
3 篇 constraint theor...
1 篇 logic programmin...
1 篇 search
1 篇 stochastic contr...
1 篇 constraint progr...
1 篇 congresses.
1 篇 computer network...
1 篇 constraint progr...
1 篇 hybrid algorithm...

机构

1 篇 institute of fin...
1 篇 laboratoire d'in...
1 篇 univ ulm fak ing...
1 篇 charles universi...
1 篇 faculty of compu...
1 篇 dipartimento di ...
1 篇 hacettepe univ d...
1 篇 natl univ singap...
1 篇 natl univ irelan...
1 篇 ibm thomas j. wa...
1 篇 inria saclay
1 篇 univ nova lisboa...
1 篇 istituto di info...
1 篇 monash univ fac ...
1 篇 univ coll cork c...
1 篇 izmir univ econ ...
1 篇 dipartimento di ...

作者

2 篇 djelloul khalil
1 篇 prestwich steven
1 篇 wallace mark
1 篇 hnich brahim
1 篇 tarim s. armagan
1 篇 fruehwirth thom
1 篇 rossi roberto
1 篇 françois fages
1 篇 razgon igor
1 篇 sylvain soliman
1 篇 yap roland h. c.
1 篇 s. bistarelli
1 篇 o'sullivan barry
1 篇 f. rossi
1 篇 barták roman
1 篇 likitvivatanavon...
1 篇 čepek ondřej
1 篇 francesca rossi
1 篇 meister marc
1 篇 m.s. pini

语言

10 篇 英文
1 篇 中文

检索条件"任意字段=11th Annual ERCIM International Workshop on Constraint Solving and Contraint Logic Programming"

共 11 条记录，以下是1-10 订阅

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

详细简洁

排序：

Recent Advances in constraints: 11th annual ercim international workshop on constraint solving and constraint logic programming, CSCLP 2006 Revised Selected and Invited Papers

Recent Advances in Constraints: 11th Annual ERCIM Internatio...

引用

11th annual European Research Consortium for Informatics and Mathematics (ercim) international workshop on constraint solving and constraint logic programming, CSCLP 2006

ISBN: (纸本)9783540738169

the proceedings contain 11 papers. the topics discussed include: hybrid algorithms in constrained programming;an attempt to dynamically break symmetries in the social golfers problem;a constraint model for state transitions in disjunctive resources;reusing CSP propagators for QCSPs;bipolar preference problems: framework, properties and solving techniques;distributed forward checking may lie for privacy;solving first-order constraints in the theory of the evaluated trees;extracting microstructure in binary constraint networks;complexity of a CHR solver for existentially quantifies conjunctions of equations over trees;efficient recognition of acrylic clustered constraint satisfaction problems;and cost-based filtering for stochastic inventory control.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Hybrid algorithms in constraint programming

Hybrid algorithms in constraint programming

引用

11th annual ercim international workshop on constraint solving and contraint logic programming

作者： Wallace, Mark Monash Univ Fac Informat Technol Clayton Vic 3800 Australia

this paper surveys hybrid algorithms from a constraint programming perspective. It introduces techniques used within a constructive search framework, such as propagation and linear relaxation, as well as techniques us... 详细信息

ISBN: (纸本)9783540738169

关键词： constraint programming hybrid algorithms search

来源：评论

学校读者我要写书评

暂无评论

Extracting microstructure in binary constraint networks

Extracting microstructure in binary constraint networks

引用

11th annual ercim international workshop on constraint solving and contraint logic programming

作者： Likitvivatanavong, Chavalit Yap, Roland H. C. Natl Univ Singapore Sch Comp Singapore 117548 Singapore

ISBN: (纸本)9783540738169

We present algorithms that perform the extraction of partial assignments from binary constraint Satisfaction Problems without introducing new constraints. they are based on a new perspective on domain values: we view a value not as a single, indivisible unit, but as a combination of value fragments. Applications include removing nogoods while maintaining constraint arity, learning nogoods in the constraint network, enforcing on neighborhood inverse consistency and removal of unsolvable sub-problems from the constraint network.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Complexity of a CHR solver for existentially quantified conjunctions of equations over trees

Complexity of a CHR solver for existentially quantified conj...

引用

11th annual ercim international workshop on constraint solving and contraint logic programming

作者： Meister, Marc Djelloul, Khalil Fruehwirth, thom Univ Ulm Fak Ingenieurwissenschaften & Informat D-89069 Ulm Germany

ISBN: (纸本)9783540738169

constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equality of rational trees that performs unification. We first prove its exponential complexity in time and space for non-flat equations and deduce from this proof a quadratic complexity for flat equations. We then present an extended CHR solver for solving existentially quantified conjunctions of non-flat equations in the theory of finite or infinite trees. We reach a quadratic complexity by first flattening the equations and introducing new existentially quantified variables, then using the classic solver, and finally eliminating particular equations and quantified variables.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Efficient recognition of acyclic clustered constraint satisfaction problems

Efficient recognition of acyclic clustered constraint satisf...

引用

11th annual ercim international workshop on constraint solving and contraint logic programming

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

ISBN: (纸本)9783540738169

In this paper we present a novel approach to solving constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to being acyclic. Such graphs are encountered in many real world application domains such as configuration, diagnosis, model-based reasoning and scheduling. We present a class of variable ordering heuristics that exploit the clustered structure of the constraint network to inform search. We show how these heuristics can be used in conjunction with nogood leaming to develop efficient solvers that can exploit propagation based on either forward checking or maintaining arc-consistency algorithms. Experimental results show that maintaining arc-consistency alone is not competitive with our approach, even if nogood learning and a well known variable ordering are incorporated. It is only by using our cluster-based heuristics can large problems be solved efficiently. the poor performance of maintaining arc-consistency is somewhat surprising, but quite easy to explain.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

An attempt to dynamically break symmetries in the social golfers problem

An attempt to dynamically break symmetries in the social gol...

引用

11th annual ercim international workshop on constraint solving and contraint logic programming

作者： Azevedo, Francisco Univ Nova Lisboa CENTRIA P-1200 Lisbon Portugal

ISBN: (纸本)9783540738169

A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased declarativity and efficiency. Such problems where one tries to find sets of values that satisfy some conditions, often present much symmetry on variables and values. In particular, the social golfers problem encompasses many possible symmetries. Allowing symmetric solutions increases search space unnecessarily, thus multiplying solution time. therefore, ordering constraints have been proposed and incorporated in set solvers. However, such constraints are imposed statically in the global problem model and are unable to detect symmetries that still occur in sub-problems after a partial labelling. In this paper we discuss how to overcome this and present an approach that sequentially labels variables avoiding such symmetries by dynamically disallowing the assignment of other values from the same equivalence class in the golfers problem. Experimental results show that this approach outperforms previous ones, recently achieved by the constraint programming community, namely over sets. Unfortunately, the current method is incomplete and may loose solutions. Nevertheless, results are correct and show that similar techniques can be used efficiently to obtain faster solutions.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Cost-based filtering for Stochastic inventory control

Cost-based filtering for Stochastic inventory control

引用

11th annual ercim international workshop on constraint solving and contraint logic programming

作者： Tarim, S. Armagan Hnich, Brahim Rossi, Roberto Prestwich, Steven Hacettepe Univ Dept Management Ankara Turkey Izmir Univ Econ Fac Comp Sci Izmir Turkey Univ Coll Cork Constraint Comp Ctr Cork Ireland

ISBN: (纸本)9783540738169

An interesting class of production/inventory control problems considers a single product and a single stocking location, given a stochastic demand with a known non-stationary probability distribution. Under a widely-used control policy for this type of inventory system, the objective is to find the optimal number of replenishments, their timings and their respective order-up-to-levels that meet customer demands to a required service level. We extend a known CP approach for this problem using a cost-based filtering method. Our algorithm can solve to optimality instances of realistic size much more efficiently than previous approaches, often with no search effort at all.

关键词： Stochastic control systems

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in constraints 2008

引用

丛书名： Lecture Notes in Computer Science

2008年

作者： François Fages Francesca Rossi Sylvain Soliman

来源：评论

学校读者我要写书评

暂无评论

A constraint model for state transitions in disjunctive resources

A constraint model for state transitions in disjunctive reso...

引用

11th annual European Research Consortium for Informatics and Mathematics (ercim) international workshop on constraint solving and constraint logic programming, CSCLP 2006

作者： Barták, Roman Čepek, Ondřej Charles University in Prague Faculty of Mathematics and Physics Malostranské nám. 2/25 118 00 Praha 1 Czech Republic Institute of Finance and Administration Estonská 500 101 00 Praha 10 Czech Republic

ISBN: (纸本)9783540738169

Traditional resources in scheduling are simple machines where the limited capacity is the main restriction. However, in practice there frequently appear resources with more complex behaviour that is described using state transition diagrams. this paper presents new filtering rules for constraints modelling the state transition diagrams. these rules are based on the idea of extending traditional precedence graphs by direct precedence relations. the proposed model also assumes optional activities and it can be used as an open model accepting new activities during the solving process. © Springer-Verlag Berlin Heidelberg 2007.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

solving first-order constraints in the theory of the evaluated trees

Solving first-order constraints in the theory of the evaluat...

引用

11th annual European Research Consortium for Informatics and Mathematics (ercim) international workshop on constraint solving and constraint logic programming, CSCLP 2006

作者： Dao, thi-Bich-Hanh Djelloul, Khalil Laboratoire d'Informatique Fondamentale d'Orléans France Faculty of Computer Science University of Ulm Germany

ISBN: (纸本)9783540738169

We present in this paper a first-order extension of the solver of Prolog III, by giving not only a decision procedure, but a full first-order constraint solver in the theory T of the evaluated trees, which is a combination of the theory of finite or infinite trees and the theory of the rational numbers with addition, subtraction and a linear dense order relation. the solver is given in the form of 28 rewriting rules which transform any first-order formula φ into an equivalent disjunction φ of simple formulas in which the solutions of the free variables are expressed in a clear and explicit way. the correctness of our algorithm implies the completeness of a first-order theory built on the model of Prolog III. © Springer-Verlag Berlin Heidelberg 2007.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：