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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Using Graph-Based CSP to Solve the Address Translation Problem 22nd

Using Graph-Based CSP to Solve the Address Translation Probl...

引用

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

作者： Aharoni, Merav Ben-Haim, Yael Doron, Shai Koyfman, Anatoly Tsanko, Elena Veksler, Michael IBM Res Haifa Israel IBM Syst Austin TX USA

ISBN: (纸本)9783319449531;9783319449524

The hardware address translation mechanism is an essential part of modern microprocessor memory management. The ever-growing demand for performance and low power of integrated circuits makes this mechanism exceptionally complex, and its verification requires sophisticated test generation tools. This paper presents a solution, based on constraint satisfaction, to generate stimuli for testing address translation. The address translation process passes through a sequence of steps and can therefore be naturally described as a directed acyclic graph. We developed a framework that we call graph-based constraint satisfaction problems (GCSP). These problems consist of a directed graph, combined with a CSP, where each variable and constraint of the CSP is linked to a particular node or edge of the graph. A solution to the problem is a path in the graph, such that all constraints defined along this path must be satisfied. We base our algorithm for solving GCSPs on conditional CSP. We successfully used this technology to verify the memory management units of several industrial microprocessors.

关键词： constraint programming Graph Address translation Memory management unit Processor verification Conditional CSP Network Path Dynamic CSP Graphplan Planning

来源：评论

学校读者我要写书评

暂无评论

Improved Linearization of constraint programming Models 22nd

Improved Linearization of Constraint Programming Models

引用

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

作者： Belov, Gleb Stuckey, Peter J. Tack, Guido Wallace, Mark Monash Univ Caulfield Campus Caulfield Australia Univ Melbourne CSIRO Data61 Parkville Vic Australia

ISBN: (纸本)9783319449531;9783319449524

constraint programming (cp) standardizes many specialized "global constraints" allowing high-level modelling of combinatorial optimization and feasibility problems. Current Mixed-Integer Linear programming (MIP) technology lacks both a modelling language and a solving mechanism based on high-level constraints. MiniZinc is a solver-independent cp modelling language. The solver interface works by translating a MiniZinc model into the simpler language FlatZinc. A specific solver can provide its own redefinition library of MiniZinc constraints. This paper describes improvements to the redefinitions for MIP solvers and to the compiler front-end. We discuss known and new translation methods, in particular we introduce a coordinated decomposition for domain constraints. The redefinition library is tested on the benchmarks of the MiniZinc Challenges 2012-2015. Experiments show that the two solving paradigms have rather diverse sets of strengths and weaknesses. We believe this is an important step for modelling languages. It illustrates that the high-level approach of recognizing and naming combinatorial substructure and using this to define a model, common to cp modellers, is equally applicable to those wishing to use MIP solving technology. It also makes the goal of solver-independent modelling one step closer. At least for prototyping, the new front-end frees the modeller from considering the solving technology, extracting very good performance from MIP solvers for high-level cp-style MiniZinc models.

关键词： Combinatorial optimization High-level modelling Automatic reformulation Linear decomposition Context-aware reformulation

来源：评论

学校读者我要写书评

暂无评论

Compact-Table: Efficiently Filtering Table constraints with Reversible Sparse Bit-Sets 22nd

Compact-Table: Efficiently Filtering Table Constraints with ...

引用

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

作者： Demeulenaere, Jordan Hartert, Renaud Lecoutre, Christophe Perez, Guillaume Perron, Laurent Regin, Jean-Charles Schaus, Pierre UCLouvain Louvain Belgium Univ Artois CRIL F-62300 Lens France CNRS F-62300 Lens France Univ Nice Nice France Google Paris France

ISBN: (纸本)9783319449531;9783319449524

In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator for table constraints in or-tools and OscaR, two publicly available cp solvers, it has never been described so far. Importantly, CT has been recently improved further with the introduction of residues, resetting operations and a data-structure called reversible sparse bit-set, used to maintain tables of supports (following the idea of tabular reduction): tuples are invalidated incrementally on value removals by means of bit-set operations. The experimentation that we have conducted with OscaR shows that CT outperforms state-of-the-art algorithms STR2, STR3, GAC4R, MDD4R and AC5-TC on standard benchmarks.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Parallel Strategies Selection 22nd

Parallel Strategies Selection

引用

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

作者： Palmieri, Anthony Regin, Jean-Charles Schaus, Pierre Huawei Technol Boulogne France Univ Nice Sophia Antipolis CNRS UMR 7271 I3S F-06900 Sophia Antipolis France Univ Louvain La Neuven Louvain La Neuve Belgium

ISBN: (纸本)9783319449531;9783319449524

We consider the problem of selecting the best variable-value strategy for solving a given problem in constraint programming. We show that the recent Embarrassingly Parallel Search method (EPS) can be used for this purpose. EPS proposes to solve a problem by decomposing it in many subproblems and to give them on-demand to workers which run in parallel. Our method uses a sample of these subproblems for comparing strategies in order to select the most promising one to be used for solving the remaining subproblems. Each subproblem of the sample is solved with all the candidate strategies in parallel using a timeout that is twice the time of the best one. The selection of the strategy is then based on the Wilcoxon signed rank test. This test is able to deal with censored data caused by timeouts and makes no assumption on the solving time distribution. The experiments we performed on a set of classical benchmarks for satisfaction and optimization problems show that our method selects most of the time the best strategy. Our method also outperforms the portfolio approach consisting of running some strategies in parallel and is competitive with the multi armed bandit framework.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Enforcing Structure on Temporal Sequences: The Allen constraint 22nd

Enforcing Structure on Temporal Sequences: The Allen Constra...

引用

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

作者： Roy, Pierre Perez, Guillaume Regin, Jean-Charles Sony CSL Paris 6 Rue Amyot F-75005 Paris France

ISBN: (纸本)9783319449531;9783319449524

Recent applications of constraint programming to entertainment, e.g., music or video, call for global constraints describing the structure of temporal sequences. A typical constraint approach is to model each temporal event in the sequence with one variable, and to state constraints on these indexed variables. However, this approach hampers the statement of constraints involving events based on temporal position, since the position depends on preceding events rather than on the index. We introduce ALLEN, a global constraint relating event indexes with temporal positions. ALLEN maintains two set-variables: the set of events occurring at a position defined by an Allen relation, and the set of their indexes. These variables enable defining structural and temporal synchronization properties that cannot be stated on indexed variables. We show that a model based on a local scheduling approach does not solve the problem, even for very small instances, highlighting the need for complex filtering. We present a model that uses Multi-valued Decision Diagrams (MDDs) to compile the Allen constraint. We show that this model can be used to state and solve two complex musical tasks: audio track synchronization and musical score generation.

关键词： Global constraints Temporal sequences Music MDD

来源：评论

学校读者我要写书评

暂无评论

Clique and constraint Models for Maximum Common (Connected) Subgraph Problems 22nd

Clique and Constraint Models for Maximum Common (Connected) ...

引用

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

作者： McCreesh, Ciaran ndiaye, Samba ndojh Prosser, Patrick Solnon, Christine Univ Glasgow Glasgow Lanark Scotland Univ Lyon 1 LIRIS UMR5205 F-69621 Villeurbanne France INSA Lyon LIRIS UMR5205 F-69621 Villeurbanne France

ISBN: (纸本)9783319449531;9783319449524

The maximum common subgraph problem is to find the largest subgraph common to two given graphs. This problem can be solved either by constraint-based search, or by reduction to the maximum clique problem. We evaluate these two models using modern algorithms, and see that the best choice depends mainly upon whether the graphs have labelled edges. We also study a variant of this problem where the subgraph is required to be connected. We introduce a filtering algorithm for this property and show that it may be combined with a restricted branching technique for the constraint-based approach. We show how to implement a similar branching technique in clique-inspired algorithms. Finally, we experimentally compare approaches for the connected version, and see again that the best choice depends on whether graphs have labels.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Optimizing Shortwave Radio Broadcast Resource Allocation via Pseudo-Boolean constraint Solving and Local Search 22nd

Optimizing Shortwave Radio Broadcast Resource Allocation via...

引用

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

作者： Ma, Feifei Gao, Xin Yin, Minghao Pan, Linjie Jin, Jiwei Liu, Hai Zhang, Jian Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Northeast Normal Univ Coll Comp Sci Changchun Peoples R China Shandong Jiaotong Univ Jinan Peoples R China

ISBN: (纸本)9783319449531;9783319449524

Shortwave radio broadcasting is the principal way for broadcasting of voice in many countries. An important problem in shortwave radio broadcasting is how to allocate transmission devices to radio programs, so that all radio programs are broadcasted properly and the overall broadcasting effect is optimized. The broadcasting effect of a program is determined by various factors, such as time, location, and device parameters. There are also restrictions on the usage of transmission devices. In this paper, we describe the allocation of shortwave radio broadcast resources as a constrained optimization problem and prove that it is NP-hard. A Pseudo-Boolean constraint formulation for the problem is presented. We also propose an efficient local search algorithm to solve the problem. Both methods are evaluated using real data. Experimental results suggest that we can find an allocation plan with good broadcasting effect quite efficiently.

关键词： Radio broadcasting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：