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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

131 篇 会议
3 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

118 篇 工学
- 114 篇 计算机科学与技术...
- 38 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 化学工程与技术
68 篇 理学
- 60 篇 数学
- 21 篇 系统科学
- 4 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
11 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 教育学

主题

26 篇 constraint theor...
14 篇 constraint satis...
9 篇 computer program...
8 篇 constraint progr...
6 篇 linear programmi...
4 篇 integer programm...
3 篇 target cost
3 篇 problem solving
3 篇 goal programming
3 篇 mathematical log...
3 篇 programming lang...
3 篇 artificial intel...
3 篇 logics and meani...
3 篇 scheduling
2 篇 software enginee...
2 篇 modeling languag...
2 篇 symmetry
2 篇 constrained opti...
2 篇 logic programmin...
2 篇 global constrain...

机构

3 篇 univ coll cork c...
3 篇 univ st andrews ...
3 篇 univ oxford comp...
3 篇 natl univ irelan...
3 篇 univ melbourne m...
3 篇 brown univ provi...
2 篇 univ st andrews ...
2 篇 nicta nsw
2 篇 insight centre f...
2 篇 univ genoa dibri...
2 篇 cork constraint ...
2 篇 univ coll cork d...
2 篇 univ london roya...
2 篇 imdea software i...
2 篇 aix marseille un...
2 篇 aix marseille un...
2 篇 univ coll cork c...
2 篇 faculty of elect...
2 篇 univ st andrews ...
1 篇 ligm ecole des p...

作者

6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 o'sullivan barry
5 篇 miguel ian
5 篇 van hentenryck p...
5 篇 jefferson christ...
5 篇 quesada luis
4 篇 kotthoff lars
4 篇 bessiere christi...
4 篇 de givry simon
3 篇 stuckey peter j.
3 篇 werner tomáš
3 篇 jeavons peter
3 篇 simonis helmut
3 篇 lombardi michele
3 篇 walsh toby
3 篇 dlask tomáš
3 篇 mehta deepak
2 篇 pearson justin
2 篇 solnon christine

语言

136 篇 英文

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

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

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

详细简洁

排序：

A Safe and Flexible CP-Based Approach for Velocity Tuning Problems

A Safe and Flexible CP-Based Approach for Velocity Tuning Pr...

引用

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

作者： Soulignac, Michael Rueher, Michel Taillibert, Patrick ISEN Lille 41 Blvd Vauban F-59046 Lille France Nice Sophia Antipolis Univ CNRS Lille France THALES Aerospace Lille France

ISBN: (纸本)9783642153952

this paper introduces a new velocity tuning approach for autonomous vehicles based on constraint programming (CP) over continuous domains. We use CP to compute a safe approximation of configurations where collisions with obstacles may occur or technological limits may be violated. the use of CP leads to a flexible approach, facilitating the incorporation of new characteristics, e.g., constraints modeling the influence of currents. We illustrate these capabilities offered by CP in the context of UAV missions. Experimental results obtained on actual wind charts are provided.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Making Adaptive an Interval constraint Propagation Algorithm Exploiting Monotonicity

Making Adaptive an Interval Constraint Propagation Algorithm...

引用

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

作者： Araya, Ignacio Trombettoni, Gilles Neveu, Bertrand Imagine LIGM Univ Univ Nice Sophia INRIA UTFSM Chile Paris France

ISBN: (纸本)9783642153952

A new interval constraint propagation algorithm;called MOnotonic Hall Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter variable domains. Embedded in an interval-based solver, Mohc shows very high performance for solving systems of numerical constraints (equations or inequalities) over the reals. However, the main drawback is that its revise procedure depends on two user-defined parameters. this paper reports a rigourous empirical study resulting in a variant of Mohc that avoids a manual tuning of the parameters. In particular, we propose a policy to adjust in an auto-adaptive way;during the search, the parameter sensitive to the monotonicity of the revised function.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Context-Sensitive Call Control Using constraints and Rules

Context-Sensitive Call Control Using Constraints and Rules

引用

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

作者： Lesaint, David Mehta, Deepak O'Sullivan, Barry Quesada, Luis Wilson, Nic BT Research and Technology BT United Kingdom Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642153952

Personalisation and context-awareness are fundamental concerns in Telephony. this paper introduces a rule-based system - 4CRULES - which enables context-sensitive call control by the means of feature configuration rules. 4CRULES is interoperable with standard context services and compositional feature architectures. It has been designed to resolve feature interactions, manage conflicting preferences, and mitigate the uncertainty affecting context data. this is achieved through a constraint optimisation model that maximises adherence to user requirements and domain constraints. Experiments on a suite of instances confirm the practicality of the approach and highlight performance- and adherence-critical factors.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

constraint Based Scheduling to Deal with Uncertain Durations and Self-Timed Execution

Constraint Based Scheduling to Deal with Uncertain Durations...

引用

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

作者： Lombardi, Michele Milano, Michela Univ Bologna DEIS I-40136 Bologna Italy

ISBN: (纸本)9783642153952

In this paper we propose off-line and on-line extensions to the Resource Constrained Project Scheduling Problem. the off-line extension is a variant of RCPSP with time lags and uncertain, bounded activity durations. In this context we improve over our previous work presented in [12] by proposing an incremental flow computation for finding minimal conflict sets and a set of filtering rules for cumulative constraint propagation. the on-line extension is based instead on considering an on-line semantics such as the Self-Timed Execution and take it into account in the scheduling process. Adding the on-line aspect to the problem makes the CSP framework no longer suitable. We have extended the CSP framework to take into account general search decisions and auxiliary unbound variables. An extensive set of experimental results show an improvement

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Ensemble Classification for constraint Solver Configuration

Ensemble Classification for Constraint Solver Configuration

引用

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

作者： Kotthoff, Lars Miguel, Ian Nightingale, Peter Univ St Andrews St Andrews KY16 9AJ Fife Scotland

ISBN: (纸本)9783642153952

the automatic tuning of the parameters of algorithms and automatic selection of algorithms has received a lot of attention recently. One possible approach is the use of machine learning techniques to learn classifiers which, given the characteristics of a particular problem, make a decision as to which algorithm or what parameters to use. Little research has been done into which machine learning algorithms are suitable and the impact of picking the "right" over the "wrong" technique. this paper investigates the differences in performance of several techniques on different data sets. it furthermore provides evidence that by using a meta-technique which combines several machine learning algorithms, we can avoid the problem of having to pick the "best" one and still achieve good performance.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

SAT Modulo theories: Getting the Best of SAT and Global constraint Filtering

SAT Modulo Theories: Getting the Best of SAT and Global Cons...

引用

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

作者： Nieuwenhuis, Robert Tech Univ Catalonia UPC Barcelona Spain

ISBN: (纸本)9783642153952

the propositional satisfiability problem (SAT) is one of the simplest instances of constraint programming (CP): variables are bi-valued (can only take values 0 or 1), and all constraints are clauses (disjunctions of literals) like (meaning that x = 1 or y = 0 or z = 0). In spite of its simplicity, SAT has become very important for practical applications, especially in the multi-billion industry of electronic design automation (EDA), and, in general, hardware and software verification. Research on SAT has been pushed by these huge industrial needs and resources, in a very pragmatic way: prestigious conferences are eager to publish papers describing how to improve performance on their real-world problems, even if these improvements are not based on highly original techniques (in contrast with conferences like CP, which tend to prefer new ideas, even if they are tested only on academic random or artificial problem instances). © 2010 Springer-Verlag.

关键词： Computer aided design

来源：评论

学校读者我要写书评

暂无评论

Towards Parallel Non Serial Dynamic programming for Solving Hard Weighted CSP

Towards Parallel Non Serial Dynamic Programming for Solving ...

引用

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

作者： Allouche, David de Givry, Simon Schiex, thomas INRA Unite Biometrie & Intelligence Artificielle UR 875 F-31320 Castanet Tolosan France

ISBN: (纸本)9783642153952

We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost functions in a tree of collection of functions called clusters. By processing the tree from the leaves up to the root, we solve each cluster concurrently, for each assignment of its separator, using a state-of-the-art exact sequential algorithm. the grain of parallelism obtained in tins way is directly related to the tree decomposition used. We use a dedicated strategy for building suitable decompositions. We present preliminary results of our prototype running on a cluster with hundreds of cores on different decomposable real problems. this implementation allowed us to solve the last open CELAR radio link frequency assignment instance to optimality.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Local Consistency and SAT-Solvers

Local Consistency and SAT-Solvers

引用

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

作者： Petke, Justyna Jeavons, Peter Univ Oxford Comp Lab Oxford OX1 3QD England

ISBN: (纸本)9783642153952

In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hyper-resolution, on the direct Boolean encoding of the CSP instance. We also show that current clause-learning SAT-solvers will deduce any positive-hyper-resolvent of a fixed size from a given set of clauses in polynomial expected time. We combine these two results to show that, without being explicitly designed to do so, current clause-learning SAT-solvers efficiently simulate k-consistency techniques, for all values of k. We then give some experimental results to show that this feature allows clause-learning SAT-solvers to efficiently solve certain families of CSP instances which are challenging for conventional CP solvers.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A Generic Visualization Platform for CP

A Generic Visualization Platform for CP

引用

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

作者： Simonis, Helmut Davern, Paul Feldman, Jacob Mehta, Deepak Quesada, Luis Carlsson, Mats Univ Coll Cork Cork Constraint Computat Ctr Dept Comp Sci Cork Ireland Swedish Inst Comp Sci SICS AB Uppsala Sweden

ISBN: (纸本)9783642153952

In this paper we describe the design and implementation of CP-VIZ, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, and the state of constraints and variables for a postmortem analysis of a constraint program. Different to most previous visualization tools, it is system independent, using a light-weight, intermediate XML format to exchange information between solvers and the visualization tools. CP-VIZ is available under an open-source licence, and has already been interfaced to four different constraint systems.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

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

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：