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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

38 篇 会议
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

40 篇 工学
- 40 篇 计算机科学与技术...
- 1 篇 软件工程
1 篇 理学
- 1 篇 数学
- 1 篇 系统科学

主题

11 篇 constraint theor...
8 篇 constraint satis...
8 篇 constraint progr...
4 篇 global constrain...
2 篇 integer programm...
2 篇 arc-consistency
2 篇 empirical evalua...
2 篇 constraint progr...
2 篇 constraint satis...
2 篇 blocking pair
2 篇 propagators
2 篇 global constrain...
2 篇 combinatorial op...
2 篇 polynomial-time ...
2 篇 most-stable matc...
2 篇 np-hardness
1 篇 traveling salesm...
1 篇 oracle coherence
1 篇 solution countin...
1 篇 all-partition ar...

机构

3 篇 univ toronto dep...
2 篇 univ glasgow sch...
2 篇 monash univ fac ...
2 篇 natl univ singap...
2 篇 univ oxford dept...
2 篇 oracle corp burl...
2 篇 royal holloway u...
2 篇 airbus def & spa...
2 篇 chinese univ hon...
1 篇 univ laval 2325 ...
1 篇 univ toulon & va...
1 篇 univ nice nice
1 篇 nyu ny usa
1 篇 upmc cnrs stms l...
1 篇 univ toulouse la...
1 篇 univ melbourne c...
1 篇 univ toulouse la...
1 篇 zuse inst berlin...
1 篇 carnegie mellon ...
1 篇 univ bologna dis...

作者

3 篇 regin jean-charl...
3 篇 hebrard emmanuel
3 篇 schaus pierre
3 篇 beck j. christop...
2 篇 solnon christine
2 篇 nejat goldie
2 篇 cabon bertrand
2 篇 mcbride iain
2 篇 veysseire daniel
2 篇 lee jimmy h. m.
2 篇 booth kyle e. c.
2 篇 trimble james
2 篇 cooper martin c.
2 篇 kadioglu serdar
2 篇 perez guillaume
2 篇 jeavons peter g.
2 篇 carbonnel clemen...
2 篇 lecoutre christo...
2 篇 yap roland h. c.
2 篇 manlove david f.

语言

42 篇 英文

检索条件"任意字段=22nd International Conference on Principles and Practice of Constraint Programming, CP 2016"

共 42 条记录，以下是21-30 订阅

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

详细简洁

排序：

Using constraint programming for the Urban Transit Crew Rescheduling Problem 22nd

Using Constraint Programming for the Urban Transit Crew Resc...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Lorca, Xavier Prud'homme, Charles Questel, Aurelien Rottembourg, Benoit Univ Nantes Inria LINA UMR 6241 TASC Ecole Mines Nantes Nantes France EURODECISION Versailles Versailles France

ISBN: (纸本)9783319449531;9783319449524

Scheduling urban and trans-urban transportation is an important issue for industrial societies. The Urban Transit Crew Scheduling Problem is one of the most important optimization problem related to this issue. It mainly relies on scheduling bus drivers' workday respecting both collective agreements and the bus schedule needs. If this problem has been intensively studied from a tactical point of view, its operational aspect has been neglected while the problem becomes more and more complex and more and more prone to disruptions. In this way, this paper presents how the constraint programming technologies are able to recover the tactical plans at the operational level in order to efficiently help in answering regulation needs after disruptions.

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

constraint programming Models for Chosen Key Differential Cryptanalysis 22nd

Constraint Programming Models for Chosen Key Differential Cr...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Gerault, David Minier, Marine Solnon, Christine Univ Lyon INSA Lyon F-69621 Villeurbanne France INRIA CITI Villeurbanne France CNRS LIRIS UMR5205 Villeurbanne France LIMOS Clermont Ferrand France

ISBN: (纸本)9783319449531;9783319449524

In this paper, we introduce constraint programming (cp) models to solve a cryptanalytic problem: the chosen key differential attack against the standard block cipher AES. The problem is solved in two steps: In Step 1, bytes are abstracted by binary values;In Step 2, byte values are searched. We introduce two cp models for Step 1: Model 1 is derived from AES rules in a straightforward way;Model 2 contains new constraints that remove invalid solutions filtered out in Step 2. We also introduce a cp model for Step 2. We evaluate scale-up properties of two classical cp solvers (Gecode and Choco) and a hybrid SAT/cp solver (Chuffed). We show that Model 2 is much more efficient than Model 1, and that Chuffed is faster than Choco which is faster than Gecode on the hardest instances of this problem. Furthermore, we prove that a solution claimed to be optimal in two recent cryptanalysis papers is not optimal by providing a better solution.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A constraint programming Approach to Multi-Robot Task Allocation and Scheduling in Retirement Homes 22nd

A Constraint Programming Approach to Multi-Robot Task Alloca...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Booth, Kyle E. C. Nejat, Goldie Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada

ISBN: (纸本)9783319449531;9783319449524

We study the application of constraint programming (cp) to the planning and scheduling of multiple social robots interacting with residents in a retirement home. The robots autonomously organize and facilitate group and individual activities among residents. The application is a multi-robot task allocation and scheduling problem in which task plans must be determined that integrate with resident schedules. The problem involves reasoning about disjoint time windows, inter-schedule task dependencies, user and robot travel times, as well as robot energy levels. We propose mixed-integer programming (MIP) and cp approaches for this problem and investigate methods for improving our initial cp approach using symmetry breaking, variable ordering heuristics, and large neighbourhood search. We introduce a relaxed cp model for determining provable bounds on solution quality. Experiments indicate substantial superiority of the initial cp approach over MIP, and subsequent significant improvements in the cp approach through our manipulations. This work is one of the few, of which we are aware, that applies cp to multi-robot task allocation and scheduling problems. Our results demonstrate the promise of cp scheduling technology as a general optimization infrastructure for such problems.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

DASH: Dynamic Approach for Switching Heuristics 22nd

DASH: Dynamic Approach for Switching Heuristics

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Di Liberto, Giovanni Kadioglu, Serdar Leo, Kevin Malitsky, Yuri Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland Oracle Corp Burlington MA 01803 USA Monash Univ Fac IT Melbourne Vic Australia

ISBN: (纸本)9783319449531;9783319449524

Complete tree search is a highly effective method for tackling combinatorial optimization and satisfaction problems. Over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems. Yet while each new approach continued to push the state-of-the-art, parallel research began to repeatedly demonstrate that there is no single method that would perform the best on all problem instances. Tackling this issue, portfolio algorithms took the process a step further, by trying to predict the best heuristic for each instance at hand. However, the motivation behind algorithm selection can be taken further still, and used to dynamically choose the most appropriate algorithm for each encountered sub-problem. © Springer international Publishing Switzerland 2016.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Backdoors to Tractable Valued CSP 22nd

Backdoors to Tractable Valued CSP

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Ganian, Robert Ramanujan, M. S. Szeider, Stefan TU Wien Algorithms & Complex Grp Vienna Austria

ISBN: (纸本)9783319449531;9783319449524

We extend the notion of a strong backdoor from the CSP setting to the Valued CSP setting (VCSP, for short). This provides a means for augmenting a class of tractable VCSP instances to instances that are outside the class but of small distance to the class, where the distance is measured in terms of the size of a smallest backdoor. We establish that VCSP is fixed-parameter tractable when parameterized by the size of a smallest backdoor into every tractable class of VCSP instances characterized by a (possibly infinite) tractable valued constraint language of finite arity and finite domain. We further extend this fixed-parameter tractability result to so-called "scattered classes" of VCSP instances where each connected component may belong to a different tractable class.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

The PPSZ Algorithm for constraint Satisfaction Problems on More Than Two Colors 22nd

The PPSZ Algorithm for Constraint Satisfaction Problems on M...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Hertli, Timon Hurbain, Isabelle Millius, Sebastian Moser, Robin A. Scheder, Dominik Szedlak, May ETH Zurich Switzerland Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9783319449531;9783319449524

The PPSZ algorithm (Paturi et al., FOCS 1998) is the fastest known algorithm for k-SAT. We show how to extend the algorithm and its analysis to (d, k)-Clause Satisfaction Problems where each variable ranges over d different values. Given an input instance with a unique satisfying assignment, the resulting algorithm is the fastest known algorithm for ( d, k)-CSP except when ( d, k) is ( 3, 2) or ( 4, 2). For the general case of multiple satisfying assignments, our algorithm is the fastest known for all k >= 4.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A Nearly Exact Propagation Algorithm for Energetic Reasoning in O(n² log n) 22nd

A Nearly Exact Propagation Algorithm for Energetic Reasoning...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Tesch, Alexander Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany

ISBN: (纸本)9783319449531;9783319449524

In constraint programming, energetic reasoning constitutes a powerful start time propagation rule for cumulative scheduling problems (CuSP). This article first presents an improved time interval checking algorithm that is derived from a polyhedral model. In a second step, we extend this algorithm to an energetic reasoning propagation algorithm with time complexity O(n(2) log n) where n denotes the number of jobs. The idea is based on a new sweep line subroutine that efficiently evaluates energy overloads of each job on the relevant time intervals. In particular, our algorithm performs energetic reasoning propagations for every job. In addition, we show that on the vast number of relevant intervals our approach achieves the maximum possible propagations according to the energetic reasoning rule.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Efficient Filtering for the Unary Resource with Family-Based Transition Times 22nd

Efficient Filtering for the Unary Resource with Family-Based...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Van Cauwelaert, Sascha Dejemeppe, Cyrille Monette, Jean-Noel Schaus, Pierre UCLouvain ICTEAM Louvain La Neuve Belgium Tacton Syst Stockholm Sweden

ISBN: (纸本)9783319449531;9783319449524

We recently proposed an extension to Vilim's propagators for the unary resource constraint in order to deal with sequence-dependent transition times. While it has been shown to be scalable, it suffers from an important limitation: when the transition matrix is sparse, the additional filtering, as compared to the original from Vilim's algorithm, drops quickly. Sparse transition time matrices occur especially when activities are grouped into families with zero transition times within a family. The present work overcomes this weakness by relying on the transition times between families of activities. The approach is experimentally evaluated on instances of the Job-Shop Problem with Sequence Dependent Transition Times. Our experimental results demonstrate that the approach outperforms existing ones in most cases. Furthermore, the proposed technique scales well to large problem instances with many families and activities.

关键词： constraint programming Scheduling Job-Shop Sequence-dependent transition times Family Global constraint Traveling Salesman Problem Dynamic programming Lower bound

来源：评论

学校读者我要写书评

暂无评论

The Dichotomy for Conservative constraint Satisfaction is Polynomially Decidable 22nd

The Dichotomy for Conservative Constraint Satisfaction is Po...

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Carbonnel, Clement CNRS LAAS 7 Ave Colonel Roche F-31400 Toulouse France Univ Toulouse INP Toulouse LAAS F-31400 Toulouse France

ISBN: (纸本)9783319449531;9783319449524

Given a fixed constraint language Gamma, the conservative CSP over G (denoted by c-CSP(Gamma)) is a variant of CSP(Gamma) where the domain of each variable can be restricted arbitrarily. In [5] a dichotomy has been proven for conservative CSP: for every fixed language Gamma, c-CSP(Gamma) is either in P or NP-complete. However, the characterization of conservatively tractable languages is of algebraic nature and the recognition algorithm provided in [5] is super-exponential in the domain size. The main contribution of this paper is a polynomial-time algorithm that, given a constraint language Gamma as input, decides if c-CSP(Gamma) is tractable. In addition, if Gamma is proven tractable the algorithm also outputs its coloured graph, which contains valuable information on the structure of Gamma.

关键词： constraint satisfaction problems dichotomies Language Conservative communicating sequential processes information structure chip scale packaging phosphocellulose

来源：评论

学校读者我要写书评

暂无评论

The Multirate Resource constraint 22nd

The Multirate Resource Constraint

引用

22nd international conference on the principles and practice of constraint programming (cp)

作者： Bonfietti, Alessio Zanarini, Alessandro Lombardi, Michele Milano, Michela Univ Bologna DISI Bologna Italy ABB Corp Res Ctr Baden Switzerland

ISBN: (纸本)9783319449531;9783319449524

Many real world cyclic scheduling problems involve applications that need to be repeated with different periodicity. For example, multirate control systems present multiple control loops that are organized hierarchically: the higher-level loop responds to the slower system dynamics and typically its period can be a few orders of magnitude longer than the lowest level. Cyclic scheduling problems can be cast into classical RcpSP instances via a technique called unfolding [4,6], which causes graph expansion. In the case of multirate applications, this expansion can be significantly large. In this context, finding a high-quality allocation and schedule could be very challenging. In this paper, we propose a new Multirate Resource constraint, modeling unary resources, that avoids graph expansion by exploiting the multirate nature of the schedule in its filtering algorithm. In an experimentation on synthetic and real-world instances, we show that our method drastically outperforms approaches based on state-of-the-art unfolding and constraint based scheduling.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：