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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,005 篇 会议
51 篇 期刊文献
5 册 图书

馆藏范围

1,060 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

900 篇 工学
- 876 篇 计算机科学与技术...
- 526 篇 软件工程
- 45 篇 信息与通信工程
- 29 篇 电气工程
- 22 篇 控制科学与工程
- 10 篇 机械工程
- 6 篇 建筑学
- 6 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 农业工程
- 5 篇 生物工程
- 4 篇 动力工程及工程热...
- 3 篇 航空宇航科学与技...
- 3 篇 环境科学与工程（可...
551 篇 理学
- 436 篇 数学
- 283 篇 系统科学
- 19 篇 统计学（可授理学、...
- 11 篇 物理学
- 8 篇 生物学
- 5 篇 化学
84 篇 管理学
- 69 篇 管理科学与工程(可...
- 44 篇 工商管理
- 18 篇 图书情报与档案管...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
5 篇 农学
- 5 篇 作物学
2 篇 教育学
- 2 篇 教育学
1 篇 军事学

主题

197 篇 constraint theor...
162 篇 constraint satis...
64 篇 constraint progr...
26 篇 constrained opti...
26 篇 logic programmin...
24 篇 computer program...
24 篇 answer set progr...
21 篇 integer programm...
18 篇 scheduling
15 篇 dynamic programm...
13 篇 problem solving
12 篇 linear programmi...
10 篇 global constrain...
9 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...
9 篇 java programming...
7 篇 model checking
7 篇 optimization
7 篇 local search

机构

19 篇 natl univ irelan...
18 篇 brown univ provi...
14 篇 univ connecticut...
14 篇 cork constraint ...
10 篇 cork constraint ...
8 篇 univ oxford comp...
7 篇 natl univ irelan...
7 篇 natl univ irelan...
7 篇 department of me...
6 篇 nicta nsw
6 篇 161 rue ada mont...
6 篇 natl univ singap...
6 篇 univ st andrews ...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 ben gurion univ ...
5 篇 brown univ dept ...
5 篇 department of co...

作者

29 篇 stuckey peter j.
29 篇 o'sullivan barry
22 篇 van hentenryck p...
19 篇 freuder eugene c...
18 篇 walsh toby
17 篇 quimper claude-g...
16 篇 miguel ian
16 篇 michel laurent
15 篇 smith barbara m.
14 篇 régin jean-charl...
14 篇 bessiere christi...
14 篇 schaus pierre
13 篇 gent ian p.
13 篇 beldiceanu nicol...
13 篇 schulte christia...
13 篇 pesant gilles
12 篇 beck j. christop...
11 篇 hebrard emmanuel
10 篇 hnich brahim
10 篇 nightingale pete...

语言

1,058 篇 英文
3 篇 中文

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

共 1061 条记录，以下是841-850 订阅

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

详细简洁

排序：

Box constraint collections for adhoc constraints

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Cheng, Chi Kan Lee, Jimmy Ho Man Stuckey, Peter J. Dept of Comp. Sci. and Eng The Chinese University of Hong Kong Hong Kong Dept. of Comp. Sci. and Soft. Eng University of Melbourne Australia

ISBN: (纸本)3540202021

In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation achieves domain consistency. We develop an algorithm to automatically generate a box constraint collection for a given adhoc constraint. the result is guaranteed to be complete and correct, and achieve domain consistency. the constructive disjunction propagator for the box constraint collection can be efficiently implemented using indexicals. We give correctness and completeness result for our compilation scheme, and outline optimization techniques. Experiments show that our representation is simple, compact, and propagates efficiently. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Symmetry breaking using stabilizers

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Puget, Jean-François ILOG 9 avenue de Verdun Gentilly94253 France

ISBN: (纸本)3540202021

the addition of symmetry breaking constraints is one of the most successful symmetry breaking technique for constraint satisfaction problems (CSP). In this paper we present STAB, a method that adds some symmetry breaking constraints during the search for solution. STAB adds constraints that are not yet broken by the current partial assignment. the computation of those additional constraints require the computation of graph isomorphism at each node. Graph isomorphism is not know to be NP complete, and in practice can be solved quite efficiently using an auxiliary CSP. the method is refined to be applied to matrix problems where rows and columns can be permuted. A theoretical comparison with previously published methods shows how to combine those methods together safely. An experimental comparison on a class of highly symmetrical combinatorial problems, namely BIBD shows that STAB is more than one order of magnitude more efficient than best published techniques so far. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

An algebraic approach to multi-sorted constraints

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Bulatov, Andrei A. Jeavons, Peter Computing Laboratory University of Oxford United Kingdom

ISBN: (纸本)3540202021

Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have the same domain. We show here that this apparently minor simplification can in fact change the complexity of the problem, and hence mask the existence of certain tractable constraint types. In this paper we describe a new algebraic framework which allows us to deal more precisely with problems where different variables may have different domains. Using this new framework we are able to identify new tractable classes of constraints, by combining algorithms devised for the simplified, single domain, problem. We also systematically develop an algebraic structural theory for the general problem, and show that this theory can be used to generalise earlier results about the complexity of certain constraint types. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Discrepancy-based additive bounding for the alldifferent constraint

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Lodi, Andrea Milano, Michela Rousseau, Louis-Martin D.E.I.S Università di Bologna Viale Risorgimento 2 Bologna40136 Italy Centre for Research on Transportation Université de Montréal CP 6128 Succ Centre-Ville MontréalH3C 3J7 Canada

ISBN: (纸本)3540202021

In this paper we show how to exploit in constraint programming (CP) a well-known integer programming technique, the additive bounding procedure, when using Limited Discrepancy Search (LDS). LDS is an effective search strategy based on the concept of discrepancy, i.e., a branching decision which does not follow the suggestion of a given heuristic. the property of a node to have an associated discrepancy k can be modeled (and enforced) through a constraint, called k-discrepancy constraint. Our key result is the exploitation of the k-discrepancy constraint to improve the bound given by any relaxation of a combinatorial optimization problem by using the additive bounding idea. We believe that this simple idea can be effectively exploited to tighten relaxations in CP solvers and speed up the proof of optimality. the general use of additive bounding in conjunction with LDS has been presented in [14]. Here we focus on a particular case where the AllDifferent constraint is part of the CP model. In this case, the integration of additive bound in CP is particularly effective. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A formal approach to agent design: An overview of constraint-based agents

A formal approach to agent design: An overview of constraint...

引用

6th international conference on principles and practice of constraint programming

作者： Mackworth, AK Zhang, Y Univ British Columbia Dept Comp Sci Lab Computat Intelligence Vancouver BC V6T 1Z4 Canada Xerox Corp Palo Alto Res Ctr Syst & Practices Lab Palo Alto CA 94304 USA

Formal models for agent design are important for both practical and theoretical reasons. the constraint-Based Agent (CBA) design approach includes two formal models: constraint Nets and Timed For All-automata. A constraint net models the agents and the environment symmetrically as, possibly hybrid, dynamical systems;a timed V-automaton specifies the desired real-time dynamic behaviors of the situated agents. Given a constraint-based specification of the desired behavior, a constraint-based agent can be synthesized as a constraint solver. Using formal modeling and specification, it is also possible to verify complex agents as obeying real-time temporal constraint specifications. this overview paper presents a summary of the development and application of the CBA framework.

关键词： formal specification agent design artificial intelligence robot architectures constraint-based requirements system verification automata

来源：评论

学校读者我要写书评

暂无评论

Soft constraints: Complexity and multimorphisms

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Cohen, David A. Cooper, Martin Jeavons, Peter Krokhin, Andrei Department of Computer Science Royal Holloway University of London United Kingdom IRIT University of Toulouse III France Computing Laboratory University of Oxford United Kingdom Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)3540202021

Over the past few years there has been considerable progress in methods to systematically analyse the complexity of classical (crisp) constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the complexity of a set of classical constraints to a corresponding set of algebraic operations, known as polymorphisms. In this paper we begin a systematic investigation of the complexity of combinatorial optimisation problems expressed using various forms of soft constraints. We extend the notion of a polymorphism by introducing a more general algebraic operation, which we call a multimorphism. We show that a number of maximal tractable sets of soft constraints, both established and novel, can be characterised by the presence of particular multimorphisms. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

New tractable classes from old

New tractable classes from old

引用

6th international conference on principles and practice of constraint programming

作者： Cohen, D Jeavons, P Gault, R Univ London Dept Comp Sci Royal Holloway London WC1E 7HU England Univ Oxford Comp Lab Oxford OX1 3QD England

the constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. this paper introduces two simple methods 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.

关键词： constraint satisfaction problems complexity tractable classes disjunctive constraints

来源：评论

学校读者我要写书评

暂无评论

Solving finite domain constraint hierarchies by local consistency and tree search

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Bistarelli, Stefano Codognet, Philippe Hui, Kin-Chuen Lee, Jimmy Ho Man Istituto di Informatica e Telematica CNR Pisa Italy Dipartimento di Scienze Universitá degli Studi ‘G. D’annunzio’ di Chieti-Pescara Italy Department of Computer Science University of Paris 6 France Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong

ISBN: (纸本)3540202021

We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-based constraint satisfaction problems (SCSPs), we define constraint hierarchy k-consistency (CH-k-C) and give a CH-2-C enforcement algorithm. We demonstrate how the CH-2-C algorithm can be seamlessly integrated into the ordinary branch-and-bound algorithm to make it a finite domain CH solver. Experimentation confirms the efficiency and robustness of our proposed solver prototype. Unlike other finite domain CH solvers, our proposed method works for both local and global comparators. In addition, our solver can support arbitrary error functions. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

constraints for breaking more row and column symmetries

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Frisch, Alan M. Jefferson, Chris Miguel, Ian Artificial Intelligence Group Department of Computer Science University of York York United Kingdom

ISBN: (纸本)3540202021

constraint programs containing a matrix of two (or more) dimensions of decision variables often have row and column symmetries: in any assignment to the variables the rows can be swapped and the columns can be swapped without affecting whether or not the assignment is a solution. this introduces an enormous amount of redundancy when searching a space of partial assignments. It has been shown previously that one can remove consistently some of these symmetries by extending such a program with constraints that require the rows and columns to be lexicographically ordered. this paper identifies and studies the properties of a new additional constraint—the first row is less than or equal to all permutations of all other rows—that can be added consistently to break even more symmetries. Two alternative implementations of this stronger symmetry-breaking method are investigated, one of which employs a new algorithm that in time linear in the size of the matrix enforces the constraint that the first row is less than or equal to all permutations of all other rows. It is demonstrated experimentally that our method for breaking more symmetries substantially reduces search effort. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Boosting search with variable elimination in constraint optimization and constraint satisfaction problems

Boosting search with variable elimination in constraint opti...

引用

6th international conference on principles and practice of constraint programming

作者： Larrosa, J Dechter, R Univ Politecn Cataluna Barcelona Spain Univ Calif Irvine Irvine CA USA

there are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph parameter called induced width, which renders the approach infeasible for many problem classes. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be effectively combined with search, because the elimination of variables may reduce drastically the search tree size. In this paper we introduce BE-BB(k), a hybrid general algorithm that combines search and variable elimination. the parameter k controls the tradeoff between the two strategies. the algorithm is space exponential in k. Regarding time, we show that its complexity is bounded by k and a structural parameter from the constraint graph. We provide experimental evidence that the hybrid algorithm can outperform state-of-the-art algorithms in constraint satisfaction, Max-CSP and Weighted CSP. Especially in optimization tasks, the advantage of our approach over plain search can be overwhelming.

关键词： constraint satisfaction constraint optimization soft constraints bucket elimination branch and bound

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共107页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：