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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

60 篇 会议
29 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

41 篇 工学
- 39 篇 计算机科学与技术...
- 22 篇 软件工程
- 7 篇 电气工程
- 6 篇 信息与通信工程
- 1 篇 冶金工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
40 篇 理学
- 34 篇 数学
- 27 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...

主题

15 篇 constraint satis...
9 篇 constraint theor...
4 篇 logic programmin...
4 篇 semantics
2 篇 integer programm...
2 篇 empirical evalua...
2 篇 constraint progr...
2 篇 blocking pair
2 篇 computer program...
2 篇 constraint progr...
2 篇 polynomial-time ...
2 篇 most-stable matc...
2 篇 np-hardness
2 篇 job shop schedul...
1 篇 metals
1 篇 oracle coherence
1 篇 constraint logic...
1 篇 java bytecode
1 篇 coverage testing
1 篇 re-sizable decom...

机构

3 篇 department of co...
2 篇 univ glasgow sch...
2 篇 department wni u...
2 篇 irst i38100 tren...
2 篇 department of co...
2 篇 department of co...
2 篇 inria rocquencou...
1 篇 computing scienc...
1 篇 university of ne...
1 篇 department of co...
1 篇 univ nice nice
1 篇 ntt communicatio...
1 篇 centre for resea...
1 篇 department of co...
1 篇 computer science...
1 篇 cert/onera 2 av....
1 篇 zuse inst berlin...
1 篇 laboratoire d’in...
1 篇 dept. of mathema...
1 篇 liens ecole norm...

作者

4 篇 walsh toby
4 篇 lee j.h.m.
4 篇 leung ho-fung
3 篇 gent ian p.
3 篇 rossi francesca
3 篇 frank jeremy
3 篇 macintyre ewan
2 篇 chmeiss assef
2 篇 prosser patrick
2 篇 tinelli cesare
2 篇 ruet paul
2 篇 cohen david
2 篇 harandi mehdi
2 篇 yonezawa akinori
2 篇 meisels amnon
2 篇 mcbride iain
2 篇 mello p.
2 篇 gudes ehud
2 篇 jeavons peter
2 篇 kepser stephan

语言

90 篇 英文

检索条件"任意字段=2nd International Conference on Principles and Practice of Constraint Programming, CP 1996"

共 90 条记录，以下是61-70 订阅

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

详细简洁

排序：

A labelling arc consistency method for functional constraints 2nd

A labelling arc consistency method for functional constraint...

引用

2nd international conference on principles and practice of constraint programming, cp 1996

作者： Affane, M.S. Bennaceur, H. Laboratoire d’Informatique de Paris-Nord CNRS URA 1507 Université Paris-Nord Institut Galilée avenue J.B.Clément Villetaneuse93430 France

ISBN: (纸本)3540615512

Numerous arc consistency algorithms have been developed for filtering constraint satisfaction problems (CSP). But, few of them considered the semantic of the constraints. Arc consistency algorithms work with a queue containing element to reconsider. Then, some constraints may be checked many times. Recently, Liu has proposed an improved specific version AC5+ of the AC5 algorithm. AC5+ deals with a subclass of functional constraints, called "Increasing Functional constraints (IFC)". It allows some IFC constraints of a CSP to be checked only once, when achieving arc consistency. In this paper, we propose a labelling arc consistency method (LAC) for filtering CSPs containing functional constraints. LAC uses two concepts:arc consistency and label-arc consistency. It allows all functional constraints to be checked only once, and some general constraints to be checked at most twice. Although, the complexity of LAC is still in O(ed) for functional constraints, where e is the number of constraints and d the size of the largest domain, the technique used in LAC leads to improve the performances and the effectiveness of classical arc consistency algorithms for CSPs containing functional constraints. The empirical results presented show the substantial gain brought by the LAC method. © Springer-Verlag Berlin Heidelberg 1996.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Functional constraint hierarchies in CLP

引用

Lecture Notes in Computer Science 1996年 1118卷 529-529页

作者： Bouzoubaa, Mouhssine

来源：评论

学校读者我要写书评

暂无评论

Meta constraint logic programming architecture

引用

Lecture Notes in Computer Science 1996年 1118卷 549-549页

作者： Lamma, E. Mello, P. Milano, M.

来源：评论

学校读者我要写书评

暂无评论

An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem 2nd

An empirical study of dynamic variable ordering heuristics f...

引用

2nd international conference on principles and practice of constraint programming, cp 1996

作者： Gent, Ian P. MacIntyre, Ewan Prosser, Patrick Smith, Barbara M. Walsh, Toby Department of Computer Science University of Strathclyde GlasgowGl 1XH United Kingdom Division of Artificial Intelligence School of Computer Studies University of Leeds LeedsLS2 9JT United Kingdom IRST I38100 Trento and DIST GenovaI16145 Italy

ISBN: (纸本)3540615512

The constraint satisfaction community has developed a number of heuristics for variable ordering during backtracking search. For example, in conjunction with algorithms which check forwards, the Fail-First (FF) and Brelaz (Bz) heuristics are cheap to evaluate and are generally considered to be very effective. Recent work to understand phase transitions in NP-complete problem classes enables us to compare such heuristics over a large range of different kinds of problems. Furthermore, we are now able to start to understand the reasons for the success, and therefore also the failure, of heuristics, and to introduce new heuristics which achieve the successes and avoid the failures. In this paper, we present a comparison of the Bz and FF heuristics in forward checking algorithms applied to randomly-generated binary CSP's. We also introduce new and very general heuristics and present an extensive study of these. These new heuristics are usually as good as or better than Bz and FF, and we identify problem classes where our new heuristics can be orders of magnitude better. The result is a deeper understanding of what helps heuristics to succeed or fail on hard random problems in the context of forward checking, and the identification of promising new heuristics worthy of further investigation. © Springer-Verlag Berlin Heidelberg 1996.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

constraint program for solving the job-shop problem