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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
20 册 图书

馆藏范围

1,075 篇 电子文献
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 篇 artificial intel...
15 篇 dynamic programm...
14 篇 mathematical log...
13 篇 problem solving
12 篇 linear programmi...
12 篇 programming lang...
10 篇 global constrain...
10 篇 logics and meani...
9 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...

机构

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,073 篇 英文
3 篇 中文

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

共 1076 条记录，以下是241-250 订阅

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

详细简洁

排序：

On the Containment of Forbidden Patterns Problems

On the Containment of Forbidden Patterns Problems

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Madelaine, Florent IUT Informat LIMOS CNRS UMR 6158 F-63172 Aubiere France

Forbidden patterns problems are a generalisation of (finite) constraint satisfaction problems which are definable in Feder and Vardi9;s logic MMSNP [1]. in fact, they are examples of infinite constraint satisfactio... 详细信息

ISBN: (纸本)9783642153952

Forbidden patterns problems are a generalisation of (finite) constraint satisfaction problems which are definable in Feder and Vardi's logic MMSNP [1]. in fact, they are examples of infinite constraint satisfaction problems with nice model theoretic properties introduced by Bodirsky [2]. In previous work [3], we introduced a normal form for these forbidden patterns problems which allowed us to provide an effective characterisation of when a problem is a finite or infinite constraint satisfaction problem. One of the central concepts of this normal form is that of a recolouring. In the presence of a recolouring from a forbidden patterns problem Omega(1) to another forbidden patterns problem Omega(2), containment of Omega(1) in Omega(2) follows. the converse does not hold in general and it remained open whether it did in the case of problems being given in our normal form. In this paper, we prove that this is indeed the case. We also show that the recolouring problem is Pi(p)(2)-harpd and in Sigma(p)(3).

关键词： constraint Satisfaction Graph Homomorphism Logic in Computer Science Monadic Second Order Logic Computational Complexity

来源：评论

学校读者我要写书评

暂无评论

Modelling Equidistant Frequency Permutation Arrays: An Application of constraints to Mathematics

Modelling Equidistant Frequency Permutation Arrays: An Appli...

引用

15th international conference on principles and practice of constraint programming (CP 2009)

作者： Huczynska, Sophie McKay, Paul Miguel, Ian Nightingale, Peter Univ St Andrews Sch Math & Stat St Andrews KY16 9AJ Fife Scotland Univ St Andrews Sch Comp Sci St Andrews KY16 9AJ Fife Scotland

ISBN: (纸本)9783642042430

Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol Occurs the same number of times in each codeword. the problem is to find a set of codewords Such that any pair of codewords are a given uniform Hamming distance apart. the equidistant case is of special interest given the result that any optimal constant composition code is equidistant. this paper presents, compares and combines a number of different constraint formulations of this problem class, including a new method of representing permutations with constraints. Using these constraint models, we are able to establish several new results, which are contributing directly to mathematical research in this area.(1)

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Defining and Evaluating Heuristics for the Compilation of constraint Networks 23rd

Defining and Evaluating Heuristics for the Compilation of Co...

引用

33rd international conference on Logic programming / 23rd international conference on principles and practice of constraint programming (CP) / 20th international conference on theory and Applications of Satisfiability Testing (SAT)

作者： Lagniez, Jean-Marie Marquis, Pierre Paparrizou, Anastasia Univ Artois CRIL Lens France CNRS Lens France

ISBN: (纸本)9783319661582;9783319661575

Several branching heuristics for compiling in a top-down fashion finite-domain constraint networks into multi-valued decision diagrams (MDD) or decomposable multi-valued decision graphs (MDDG) are empirically evaluated, using the cn2mddg compiler. this MDDG compiler has been enriched with various additional branching rules. these rules can be gathered into two families, the one consisting of heuristics for the satisfaction problem (which are suited to compiling networks into MDD representations) and the family of heuristics favoring decompositions (which are relevant when the MDDG language is targeted). Our empirical investigation on a large dataset shows the value of decomposability (targeting MDDG allows for compiling many more instances and leads to much smaller compiled representations). the well-known (Dom/Wdeg) heuristics appears as the best choice for compiling networks into MDD. When MDDG is the target, a new rule, based on a dynamic, yet parsimonious use of hypergraph partitioning for the decomposition purpose turns out to be the best option. As expected, the best heuristics for the satisfaction problem perform better than the best heuristics favoring decompositions when MDD is targeted, and the converse is the case when MDDG is targeted.

关键词： Knowledge compilation Top-down compiler Heuristics

来源：评论

学校读者我要写书评

暂无评论

Connecting ABT with Arc Consistency

引用

14th international conference on principles and practice of constraint programming (CP 2008)

作者： Brito, Ismel Meseguer, Pedro CSIC IIIA Bellaterra 09193 Spain

ISBN: (纸本)9783540859574

ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogoods has an empty left-hand side, the considered value is eliminated unconditionally, once and for all. this value deletion can be propagated using standard arc consistency techniques, producing new deletions in the domains of other variables. this causes substantial reductions in the search effort required to solve a class of problems. We also extend this idea to the propagation of conditional deletions. something already proposed in the past. We provide experimental results that show the benefits of the proposed approach, especially considering communication cost.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Preference Elicitation for DCOPs 23rd

Preference Elicitation for DCOPs

引用

作者： Tabakhi, Atena M. Le, Tiep Fioretto, Ferdinando Yeoh, William Washington Univ Dept Comp Sci & Engn St Louis MO 63110 USA New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA

ISBN: (纸本)9783319661582;9783319661575

Distributed constraint Optimization Problems (DCOPs) offer a powerful approach for the description and resolution of cooperative multi-agent problems. In this model, a group of agents coordinate their actions to optimize a global objective function, taking into account their preferences or constraints. A core limitation of this model is the assumption that the preferences of all agents or the costs of all constraints are specified a priori. Unfortunately, this assumption does not hold in a number of application domains where preferences or constraints must be elicited from the users. One of such domains is the Smart Home Device Scheduling (SHDS) problem. Motivated by this limitation, we make the following contributions in this paper: (1) We propose a general model for preference elicitation in DCOPs;(2) We propose several heuristics to elicit preferences in DCOPs;and (3) We empirically evaluate the effect of these heuristics on random binary DCOPs as well as SHDS problems.

关键词： Distributed constraint Optimization Smart homes Preference elicitation

来源：评论

学校读者我要写书评

暂无评论

Scheduling of Mobile Robots Using constraint programming 25th

Scheduling of Mobile Robots Using Constraint Programming

引用

25th international conference on the principles and practice of constraint programming (CP)

作者： Murin, Stanislav Rudova, Hana Masaryk Univ Fac Informat Brno Czech Republic

ISBN: (纸本)9783030300487

Mobile robots in flexible manufacturing systems can transport components for jobs between machines as well as process jobs on selected machines. While the job shop problem with transportation resources allows encapsulating of transportation, this work concentrates on the extended version of the problem, including the processing by mobile robots. We propose a novel constraint programming model for this problem where the crucial part of the model lies in a proper inclusion of the transportation. We have implemented it in the Optimization programming Language using the CP Optimizer, and compare it with the existing mixed integer programming solver. While both approaches are capable of solving the problem optimally, a new constraint programming approach works more efficiently, and it can compute solutions in more than an order of magnitude faster. Given that, the results of more realistic data instances are delivered in real-time, which is very important in a smart factory.

关键词： Scheduling constraint programming Mobile robot Flexible manufacturing system Transportation IBM ILOG CPLEX Optimization Studio

来源：评论

学校读者我要写书评

暂无评论

Solving an air conditioning system problem in an embodiment design context using constraint satisfaction techniques

Solving an air conditioning system problem in an embodiment ...

引用

13th international conference on principles and practice of constraint programming (CP 2007)

作者： Chenouard, Raphael Sebastian, Patrick Granvilliers, Laurent CNRS Transferts Ecoulements FLuides Energet ENSAM Bordeaux F-33405 Talence France Univ Nantes Lab Dinformatique Nantes Atlantique CNRS F-44322 Nantes 3 France

ISBN: (纸本)9783540749691

In this paper, the embodiment design of an air conditioning system (ACS) in an aircraft is investigated using interval constraint satisfaction techniques. the detailed ACS model is quite complex to solve, since it contains many coupled variables and many constraints corresponding to complex physics phenomena. Some new heuristics and notions based on embodiment design knowledge, are briefly introduced to undertake some embodiment design concepts and to obtain a more relevant and more efficient solving process than classical algorithms. the benefits of using constraint programming in embodiment design are discussed and some difficulties for designers using CP tools are shortly detailed.

关键词： Air conditioning

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Local Search for the Automatic Generation of Architectural Tests

Constraint-Based Local Search for the Automatic Generation o...

引用

15th international conference on principles and practice of constraint programming (CP 2009)

作者： Van Hentenryck, Pascal Coffrin, Carleton Gutkovich, Boris Brown Univ Providence RI 02912 USA Intel Corp Haifa Israel

ISBN: (纸本)9783642042430

this paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satisfaction problems which typically feature both hard and soft constraints and very large domains (e.g., all memory addresses). Moreover, the goal is to generate a. large number of diverse Solutions under tight runtime constraints. To improve solution diversity, this paper proposes a, novel approach to ATGPs by modeling them as MAXDIVERSEkSET problems and solving them with constraint-based local search over conditional variables. the paper presents the semantics and implementation of Conditional variables in this context and demonstrates the computational benefits of the approach.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Dealing with incomplete preferences in soft constraint problems

Dealing with incomplete preferences in soft constraint probl...

引用

13th international conference on principles and practice of constraint programming (CP 2007)

作者： Gelain, Mirco Pini, Maria Silvia Rossi, Francesca Venable, K. Brent Univ Padua Dipartimento Matemat Pura & Applicata I-35100 Padua Italy

ISBN: (纸本)9783540749691

We consider soft constraint problems where some of the preferences may be unspecified. this models, for example, situations with several agents providing the data, or with possible privacy issues. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define an algorithm to find a solution which is necessarily optimal, that is, optimal no matter what the missing data will be, with the aim to ask the user to reveal as few preferences as possible. Experimental results show that in many cases a necessarily optimal solution can be found without eliciting too many preferences.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Watched literals for constraint propagation in MINION

Watched literals for constraint propagation in MINION

引用

12th international conference on principles and practice of constraint programming (CP 2006)

作者： Gent, Ian P. Jefferson, Chris Miguel, Ian Univ St Andrews Sch Comp Sci St Andrews Fife Scotland Univ Oxford Comp Lab Oxford OX1 3QD England

ISBN: (纸本)3540462678

Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the satisfiability community, can be used to provide highly efficient implementations of constraint propagators. We describe three important aspects of watched literals as we apply them to constraints, and how they are implemented in the MINION constraint solver. We show three successful applications of to constraint propagators: the sum of Boolean variables;GAC for the 'element' constraint;and GAC for the 'table' constraint.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：