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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1-10 订阅

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

详细简洁

排序：

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

引用

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

ISBN: (纸本)3540410538

the proceedings contain 47 papers. the special focus in this conference is on principles and practice of constraint programming. the topics include: constraints for interactive graphical applications;automatic generation of propagation rules for finite domains;global constraints as graph properties on a structured network of elementary constraints of the same type;universally quantified interval constraints;constraint propagation for soft constraints;constraints, inference channels and secure databases;a simple method for identifying tractable disjunctive constraints;a language for audiovisual template specification and recognition;new tractable classes from old;expressiveness of full first order constraints in the algebra of finite or infinite trees;cutting planes in constraint programming;a constraint-based framework for prototyping distributed virtual applications;a scalable linear constraint solver for user interface construction;maintaining arc-consistency within dynamic backtracking;analysis of random noise and random walk algorithms for satisfiability testing;faster algorithms for bound-consistency of the sortedness and the all different constraint;a hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences;linear formulation of constraint programming models and hybrid solvers;a global constraint combining a sum constraint and difference constraints;optimal anytime constrained simulated annealing for constrained global optimization;using randomization and learning to solve hard real-world instances of satisfiability;branching constraint satisfaction problems for solutions robust under likely changes and the phase transition in distributed constraint satisfaction problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cooperating constraint solvers 6th

引用

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

作者： Hofstedt, Petra Department of Computer Science Berlin University of Technology Germany

ISBN: (纸本)3540410538

We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined system. the modularity of our definitions of reduction relations at different levels allows the definition of cooperation strategies for the solvers according to the current requirements such that our overall system forms a general framework for cooperating solvers. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Linear formulation of constraint programming models and hybrid solvers 6th

引用

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

作者： Refalo, Philippe ILOG Les Taissounieres 1681 route des Dolines Sophia Antipolis06560 France

ISBN: (纸本)3540410538

constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization problems. We propose a way to provide a linear formulation of such a model and detail, in particular, the transformation of some global constraints. An automatic procedure for producing and updating formulations has been implemented and we illustrate it on combinatorial optimization problems. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint propagation: Between abstract models and ad hoc strategies 6th

引用

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

作者： Granvilliers, Laurent Monfroy, Eric IRIN B.P. 92208 Nantes Cedex 3F-44322 France CWI Kruislaan 413 Amsterdam1098 SJ Netherlands

ISBN: (纸本)3540410538

constraint propagation [10,7,5] (cp) is a cornerstone algorithm of constraint programming, mainly devoted to the computation of local consistency properties of constraint satisfaction problems. the abstract formulation of cp is the combination of a set of reduction functions (black-box solvers) on a domain [8,9,2,1]. Intuitively, there is a dependence relation between functions and domains, such that a function must be applied if a domain it depends on is reduced. the essential property of cp is confluence or strategy-independence. In other words, the order solvers are applied does not influence the output characterized in terms of a common fixed-point of the solvers. Owing to this remark, several strategies based on heuristics, data structures, or knowledge of the solvers have been implemented.

关键词：

来源：评论

学校读者我要写书评

暂无评论

constraint-based agents: the ABC’s of CBA’s 6th

引用

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

作者： Mackworth, Alan K. Laboratory for Computational Intelligence Department of Computer Science University of British Columbia VancouverBCV6T 1Z4 Canada

ISBN: (纸本)3540410538

the constraint-Based Agent (CBA) framework is a set of tools for designing, simulating, building, verifying, optimizing, learning and debugging controllers for agents embedded in an active environment. the agent and the environment are modelled symmetrically as, possibly hybrid, dynamical systems in constraint Nets, as developed by Zhang and Mackworth. this paper is a tutorial overview of the development and application of the CBA framework, emphasizing the important special case where the agent is an online constraint-satisfying device. Here it is often possible to verify complex agents as obeying real-time temporal constraint specifications and, sometimes, to synthesize controllers automatically. the CBA framework demonstrates the power of viewing constraint programming as the creation of online constraint-solvers in dynamic environments. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

An original constraint based approach for solving over constrained problems 6th

引用

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

作者： Régin, J.-C. Petit, T. Bessière, C. Puget, J.-F. ILOG 1681 route des Dolines Valbonne06560 France LIRMM UMR 5506 CNRS 161 rue Ada Montpellier Cedex 534392 France ILOG S.A 9 rue de Verdun BP 85 Gentilly Cedex94253 France

In this paper we present a new framework for over constrained problems. We suggest to define an over-constrained network as a global constraint. We introduce two new lower bounds of the number of violations, without m... 详细信息

ISBN: (纸本)3540410538

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A scalable linear constraint solver for user interface construction 6th

引用

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

作者： Hosobe, Hiroshi National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-kuTokyo101-8430 Japan

ISBN: (纸本)3540410538

this paper proposes an algorithm for satisfying systems of linear equality and inequality constraints with hierarchical strengths or preferences. Basically, it is a numerical method that incrementally obtains the LU decompositions of linear constraint systems. To realize this, it introduces a novel technique for analyzing hierarchical systems of linear constraints. In addition, it improves performance by adopting techniques that utilize the sparsity and disjointness of constraint systems. Based on this algorithm, the HiRise constraint solver has been designed and implemented for the use of constructing interactive graphical user interfaces. this paper shows that HiRise is scalable up to thousands of simultaneous constraints in real-time execution. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

A constraint-based framework for prototyping distributed virtual applications 6th

引用

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

作者： Gupta, Vineet Jagadeesan, Lalita Jategaonkar Jagadeesan, Radha Jiang, Xiaowei Läufer, Konstantin 201 Ravendale Mountain ViewCA94043 United States Software Production Research Dept Bell Laboratories Lucent Technologies 263 Shuman Blvd NapervilleIL60566 United States Dept. of Mathematical and Computer Sciences Loyola University Chicago 6525 N. Sheridan Road ChicagoIL60626 United States

ISBN: (纸本)3540410538

this paper describes the architecture and implementation of a constraint-based framework for rapid prototyping of distributed applications such as virtual simulations, collaborations and games. Our framework integrates three components based on (concurrent) constraint programming ideas: (1) Hybrid cc, a (concurrent) constraint modeling language for hybrid systems, (2) Sisl, a (discrete) timed constraint language for describing interactive services with flexible user interfaces and (3) Triveni, a process-algebraic language for concurrent programming. the framework is realized as a collection of tools implemented in Java. the utility of the ideas are illustrated by sketching the implementations of simple distributed applications. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Cutting planes in constraint programming: An hybrid approach 6th

引用

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

作者： Focacci, Filippo Lodi, Andrea Milano, Michela Dipartimento di Ingegneria Università di Ferrara Italy D.E.I.S Università di Bologna Italy

ISBN: (纸本)3540410538

In recent years, a growing number of attempts have been performed in order to integrate well known Operations Research(OR) techniques in constraint programming (cp) tools. the aim of the integration is to maintain the modelling facilities of the cp paradigm, while improving its performances by exploiting effective OR techniques. In our previous work, we proposed the use of optimization constraints [9], embedding a linear relaxation of the constraint itself and performing pruning on the basis of costs. In particular, domain values can be removed whenever it can be shown that their assignment will necessarily lead to solutions worse than the best solution found. In this setting, the use of cutting planes in global constraints allows to tighten the relaxation so as to infer more accurate bounds on the problem. We propose different ways of using cutting-planes in optimization constraints achieving different levels of tightness of the integration and pruning power. Even if the proposed technique is general, we use as testing application the Travelling Salesman Problem (TSPs) and its time constrained variant. Computational results compare different relaxations in terms of pruning achieved and computational complexity. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Branching constraint satisfaction problems for solutions robust under likely changes 6th

引用

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

作者： Fowler, David W. Brown, Kenneth N. University of Aberdeen AberdeenAB24 3UE United Kingdom

ISBN: (纸本)3540410538

Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make decisions in the present that will be robust in the light of future events. We introduce the branching CSP to model these situations, incorporating some elements of decision theory, and describe an algorithm for its solution that combines forward checking with branch and bound search. We also examine a simple thresholding method which can be used in conjunction with the forward checking algorithm, and we show the trade-off between time and solution quality. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：