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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

27 篇 会议

馆藏范围

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

日期分布

学科分类号

23 篇 理学
- 20 篇 系统科学
- 19 篇 数学
- 1 篇 物理学
16 篇 工学
- 14 篇 计算机科学与技术...
- 13 篇 软件工程
- 3 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 建筑学
- 1 篇 土木工程
1 篇 法学
- 1 篇 社会学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

9 篇 constraint satis...
6 篇 constraint theor...
1 篇 traveling salesm...
1 篇 hierarchical sys...
1 篇 modeling languag...
1 篇 iterative method...
1 篇 constrained opti...
1 篇 constraint handl...
1 篇 logic programmin...
1 篇 program testing
1 篇 computer program...
1 篇 artificial intel...
1 篇 formal verificat...

机构

1 篇 inra toulouse
1 篇 oxford universit...
1 篇 cermics 2004 rou...
1 篇 ilog s.a 9 rue d...
1 篇 dep. llenguatges...
1 篇 ilog les taissou...
1 篇 national institu...
1 篇 ntt communicatio...
1 篇 laboratory for c...
1 篇 irin b.p. 92208 ...
1 篇 the robotics ins...
1 篇 university of ab...
1 篇 università di pi...
1 篇 department. of c...
1 篇 university of yo...
1 篇 lirmm umr 5506 c...
1 篇 université de ni...
1 篇 dipartimento di ...
1 篇 department of co...
1 篇 sony csl paris 6...

作者

2 篇 rueher michel
1 篇 thornton j.
1 篇 puget j.-f.
1 篇 cadar cristian
1 篇 ronfard rémi
1 篇 bistarelli s.
1 篇 boizumault patri...
1 篇 lodi andrea
1 篇 cohen david
1 篇 sattar a.
1 篇 pachet françois
1 篇 jonsson peter
1 篇 nagarajan s.
1 篇 broxvall mathias
1 篇 hofstedt petra
1 篇 thiel sven
1 篇 petit t.
1 篇 renz jochen
1 篇 hirayama katsuto...
1 篇 bessière c.

语言

27 篇 英文

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

共 27 条记录，以下是11-20 订阅

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

详细简洁

排序：

SAT v CSP 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Walsh, Toby University of York York United Kingdom

ISBN: (纸本)3540410538

We perform a comprehensive study of mappings between constraint satisfaction problems (CSPs)an d propositional satisfiability (SAT). We analyse four different mappings of SAT problems into CSPs, and two of CSPs into SAT problems. For each mapping, we compare the impact of achieving arc-consistency on the CSP with unit propagation on the SAT problem. We then extend these results to CSP algorithms that maintain (some level of)arc- consistency during search like FC and MAC, and to the Davis-Putnam procedure (which performs unit propagation at each search node). Because of differences in the branching structure of their search, a result showing the dominance of achieving arc-consistency on the CSP over unit propagation on the SAT problem does not necessarily translate to the dominance of MAC over the Davis- Putnam procedure. these results provide insight into the relationship between propositional satisfiability and constraint satisfaction. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A constraint programming approach for solving rigid geometric systems 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Jermann, Christophe Trombettoni, Gilles Neve, Ertrand Rueher, Michel Université de Nice-Sophia Antipolis I3S ESSI 930 route des Colles B.P. 145 Sophia Antipolis Cedex06903 France CERMICS 2004 route des lucioles B.P. 93 Sophia Antipolis Cedex06902 France

ISBN: (纸本)3540410538

this paper introduces a new rigidification method -using interval constraint programming techniques-to solve geometric constraint systems. Standard rigidification techniques are graph-constructive methods exploiting the degrees of freedom of geometric objects. they work in two steps: a planning phase which identifies rigid clusters, and a solving phase which computes the coordinates of the geometric objects in every cluster. We propose here a new heuristic for the planning algorithm that yields in general small systems of equations. We also show that interval constraint techniques can be used not only to efficiently implement the solving phase, but also generalize former ad-hoc solving techniques. First experimental results show that this approach is more efficient than systems based on equational decomposition techniques. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Extending forward checking 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Bacchus, Fahiem Department. of Computer Science University Of Toronto 6 Kings College Road TorontoONM5S 1A4 Canada

ISBN: (纸本)3540410538

Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had the most practical impact. these algorithms use constraint propagation during search to prune inconsistent values from the domains of the uninstantiated variables. In this paper we present a general approach to extending constraint propagating algorithms, especially forward checking. In particular, we provide a simple yet flexible mechanism for pruning domain values, and show that with this in place it becomes easy to utilize new mechanisms for detecting inconsistent values during search. this leads to a powerful and uniform technique for designing new CSP algorithms: one simply need design new methods for detecting inconsistent values and then interface them with the domain pruning mechanism. Furthermore, we also show that algorithms following this design can proved to be correct in a simple and uniform way. To demonstrate the utility of these ideas five "new" CSP algorithms are presented. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

New tractable classes from old 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Cohen, David Jeavons, Peter Gault, Richard Department of Computer Science Royal Holloway University of London United Kingdom Oxford University Computing Laboratory Wolfson Building Parks Road Oxford United Kingdom

ISBN: (纸本)3540410538

Many combinatorial problems can be naturally expressed as "constraint satisfaction problems". this class of problems is known to be NP-hard in general, but a number of restrictions of the general problem have been identified which ensure tractability. this paper introduces a method of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

On dual encodings for non-binary constraint satisfaction problems 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Nagarajan, S. Goodwin, S. Sattar, A. thornton, J. Department of Computer Science University of Regina ReginaSK Canada School of Information Technology Griffith University Gold CoastQLD Australia

ISBN: (纸本)3540410538

In [Walsh and Stergiou, 1999] enforcing arc consistency (AC) in the dual encoding was shown to strictly dominate enforcing AC on the hidden or GAC on the original problem. We introduce a dual encoding that requires only a small subset of the original constraints to be stored in extension, while the remaining constraints can be stored intensionally. In this paper we present a theoretical comparison between the pruning achieved by enforcing AC on this dual encoding, versus enforcing GAC and dual arc consistency on the standard encoding. We show how the covering based encoding retains the dominance over enforcing GAC on the original problem, while using less space than the existing dual encoding. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A language for audiovisual template specification and recognition 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Carrive, Jean Roy, Pierre Pachet, François Ronfard, Rémi INA 4 avenue de l’Europe Bry-sur-Marne94 366 France INRIA Domaine de Voluceau Rocquencourt Le Chesnay Cedex78 153 France SONY CSL Paris 6 rue Amyot Paris75 005 France

ISBN: (纸本)3540410538

We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. these patterns correspond to recurring sequences of shots, which are considered as first class entities by documentalists, and used for annotation and retrieval. We introduce a language for specifying these patterns, based on an extension of Allen’s algebra with the regular expression operator +, which denotes an iteration of arbitrary length. We propose a formulation of this pattern language using the constraint satisfaction framework, in which templates are represented as constraint problems. We propose an efficient representation of domains (all subsequences of a given graph) and filtering methods for the Allen constraints. We illustrate the resulting system on a corpus of real world news broadcast examples. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A global constraint combining a sum constraint and difference constraints 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Régin, Jean-Charles Rueher, Michel ILOG Les Taissounieres HB2 1681 route des Dolines Sophia Antipolis Valbonne06560 France Université de Nice-Sophia-Antipolis I3S ESSI 930 route des Colles – B.P. 145 06903 Sophia-Antipolis France

ISBN: (纸本)3540410538

this paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum y = ∑xi, and where variables xi are subject to difference constraints of the form xj - xi ≤ c. An important application area where such problems occur is deterministic scheduling with the mean flow time as optimality criteria. Classical approaches perform a local consistency filtering after each reduction of the bound of y. the drawback of these approaches comes from the fact that the constraints are handled independently. We introduce here a global constraint that enables to tackle simultaneously the whole constraint system, and thus, yields a more effective pruning of the domains of the xi when the bounds of y are reduced. An efficient algorithm, derived from Dikjstra’s shortest path algorithm, is introduced to achieve interval consistency on this global constraint. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

An empirical study of probabilistic arc consistency as a variable ordering heuristic

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Horsch, Michael C. Havens, William S. Intelligent Systems Laboratory School of Computing Science Simon Fraser University BurnabyBCV5A 1S6 Canada

ISBN: (纸本)3540410538

We report on an empirical evaluation of a new probabilistic heuristic for constructive search in constraint satisfaction problems. the heuristic is based on the estimation of solution probability. We show empirically that this heuristic is more accurate than related heuristics, and reduces the number of consistency checks and backtracks in constructive search by up to several orders of magnitude. Our results also show that the time required to estimate solution probabilities is less than the time required for search using other well-known heuristics as the problem size increases. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

the phase transition in distributed constraint satisfaction problems: First results 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Hirayama, Katsutoshi Yokoo, Makoto Sycara, Katia Kobe University of Mercantile Marine 5-1-1 Fukae-minami-machi Higashinada-ku Kobe658-0022 Japan NTT Communication Science Laboratories 2-4 Hikaridai Seika-cho Soraku-gunKyoto619-0237 Japan The Robotics Institute Carnegie Mellon University 5000 Forbes Ave PittsburghPA15213 United States

ISBN: (纸本)3540410538

For solving a distributed CSP by a distributed constraint satisfaction algorithm, since agents usually have intra-agent constraints (constraints which are defined over variables of one agent) and inter-agent constraints (constraints which are defined over variables of multiple agents), they have not only to perform local computation to satisfy their intra- and inter-agent constraints, but also to communicate with other agents to satisfy their inter-agent constraints. the efficiency of a distributed constraint satisfaction algorithm depends on its communication cost and computation cost, and both can vary with the numbers of intra- and inter-agents constraints. therefore, it is important to know how the numbers of intra- and inter-agent constraints affect the communication and computation costs of a distributed constraint satisfaction algorithm because such an information may give us a hint to develop a more efficient distributed constraint satisfaction algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

constraint propagation for soft constraints: Generalization and termination conditions 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Bistarelli, S. Gennari, R. Rossi, F. Università di Pisa Dipartimento di Informatica Corso Italia 40 Pisa56125 Italy ILLC Institute of Logic Language and Computation University of Amsterdam N. Doelenstraat 15 Amsterdam1012 CP Netherlands Università di Padova Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy

ISBN: (纸本)3540410538

Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. this framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema. In this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：