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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

62 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 13 篇 软件工程
- 1 篇 电气工程
- 1 篇 交通运输工程
48 篇 理学
- 44 篇 数学
- 14 篇 系统科学
- 1 篇 统计学（可授理学、...
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

12 篇 constraint satis...
12 篇 constraint theor...
5 篇 computer program...
3 篇 linear programmi...
3 篇 constraint progr...
1 篇 bandit
1 篇 constraint logic...
1 篇 query languages
1 篇 inverse problems
1 篇 large neighborho...
1 篇 problem solving
1 篇 chaotic dynamica...
1 篇 modeling languag...
1 篇 adaptive search
1 篇 concolic testing
1 篇 soft neighborhoo...
1 篇 containers
1 篇 optimal systems
1 篇 redundancy
1 篇 iterative method...

机构

2 篇 cork constraint ...
2 篇 université côte ...
2 篇 univ coll cork c...
2 篇 univ melbourne m...
2 篇 faculty of elect...
1 篇 free univ amster...
1 篇 univ st andrews ...
1 篇 université côte ...
1 篇 univ nantes lina...
1 篇 tech univ catalo...
1 篇 nicta nsw
1 篇 univ melbourne n...
1 篇 antwerp maritime...
1 篇 univ melbourne d...
1 篇 ujf cnrs grenobl...
1 篇 univ york york y...
1 篇 univ artois cnrs...
1 篇 cnrs lirmm f-343...
1 篇 univ autonoma ba...
1 篇 algorithms and c...

作者

5 篇 stuckey peter j.
4 篇 régin jean-charl...
3 篇 pearson justin
3 篇 werner tomáš
3 篇 chu geoffrey
3 篇 dlask tomáš
3 篇 flener pierre
3 篇 o'sullivan barry
2 篇 prestwich steven...
2 篇 thorstensen evge...
2 篇 isoart nicolas
2 篇 miguel ian
2 篇 nightingale pete...
2 篇 gent ian p.
2 篇 de givry simon
2 篇 schaus pierre
1 篇 schoenauer marc
1 篇 prestwich steven
1 篇 fargier helene
1 篇 fontaine daniel

语言

63 篇 英文

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

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

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

详细简洁

排序：

A Parametric Propagator for Discretely Convex Pairs of SUM constraints

A Parametric Propagator for Discretely Convex Pairs of SUM C...

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Monette, Jean-Noel Beldiceanu, Nicolas Flener, Pierre Pearson, Justin Uppsala Univ Dept Informat Technol Uppsala 75105 Sweden CNRS INRIA Mines Nantes TASC Team F-44307 Nantes France

ISBN: (纸本)9783642406263;9783642406270

We introduce a propagator for abstract pairs of Sum constraints, where the expressions in the sums respect a form of convexity. this propagator is parametric and can be instantiated for various concrete pairs, including Deviation, Spread, and the conjunction of Sum and Count. We show that despite its generality, our propagator is competitive in theory and practice with state-of-the-art propagators.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Value Interchangeability in Scenario Generation

Value Interchangeability in Scenario Generation

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Prestwich, Steven D. Laumanns, Marco Kawas, Ban Univ Coll Cork Dept Comp Sci Cork Constraint Computat Ctr Cork Ireland IBM Res Zurich CH-8803 Ruschlikon Switzerland IBM Corp Thomson J Watson Res ctr Yorktown Hts NY USA

ISBN: (纸本)9783642406263;9783642406270

Several types of symmetry have been identified and exploited in constraint programming, leading to large reductions in search time. We present a novel application of one such form of symmetry: detecting dynamic value interchangeability in the random variables of a 2-stage stochastic problem. We use a real-world problem from the literature: finding an optimal investment plan to strengthen a transportation network, given that a future earthquake probabilistically destroys links in the network. Detecting interchangeabilities enables us to bundle together many equivalent scenarios, drastically reducing the size of the problem and allowing the exact solution of cases previously considered intractable and solved only approximately.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Approaches for Balancing Bike Sharing Systems

Constraint-Based Approaches for Balancing Bike Sharing Syste...

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Di Gaspero, Luca Rendl, Andrea Urli, Tommaso Univ Udine DIEGM Via Sci 206 I-33100 Udine Italy Austrian Inst Technol Mobility Dept Dynam Transport Syst Vienna Austria

ISBN: (纸本)9783642406263;9783642406270

In order to meet the users' demand, bike sharing systems must be regularly rebalanced. the problem of balancing bike sharing systems (BBSS) is concerned with designing optimal tours and operating instructions for relocating bikes among stations to maximally comply with the expected future bike demands. In this paper, we tackle the BBSS by means of constraint programming: first, we introduce two novel constraint models for the BBSS including a smart branching strategy that focusses on the most promising routes. Second, in order to speed-up the search process, we incorporate both models in a Large Neighborhood Search (LNS) approach that is adapted to the respective cp model. third, we perform a computational evaluation on instances based on real-world data, where we see that the LNS approach outperforms the Branch & Bound approach and is competitive with other existing approaches.

关键词： Bicycles

来源：评论

学校读者我要写书评

暂无评论

On the Reduction of the CSP Dichotomy Conjecture to Digraphs

On the Reduction of the CSP Dichotomy Conjecture to Digraphs

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Bulin, Jakub Delic, Dejan Jackson, Marcel Niven, Todd Charles Univ Prague Fac Math & Phys Prague Czech Republic Ryerson Univ Dept Math Toronto ON Canada La Trobe Univ Dept Math Melbourne Vic Australia

ISBN: (纸本)9783642406263;9783642406270

It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Breaking Symmetry with Different Orderings

Breaking Symmetry with Different Orderings

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Narodytska, Nina Walsh, Toby NICTA Sydney NSW Australia UNSW Sydney NSW Australia

ISBN: (纸本)9783642406263;9783642406270

We can break symmetry by eliminating solutions within each symmetry class. For instance, the Lex-Leader method eliminates all but the smallest solution in the lexicographical ordering. Unfortunately, the Lex-Leader method is intractable in general. We prove that, under modest assumptions, we cannot reduce the worst case complexity of breaking symmetry by using other orderings on solutions. We also prove that a common type of symmetry, where rows and columns in a matrix of decision variables are interchangeable, is intractable to break when we use two promising alternatives to the lexicographical ordering: the Gray code ordering (which uses a different ordering on solutions), and the Snake-Lex ordering (which is a variant of the lexicographical ordering that re-orders the variables). Nevertheless, we show experimentally that using other orderings like the Gray code to break symmetry can be beneficial in practice as they may better align with the objective function and branching heuristic.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Global Inverse Consistency for Interactive constraint Satisfaction

Global Inverse Consistency for Interactive Constraint Satisf...

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Bessiere, Christian Fargier, Helene Lecoutre, Christophe Univ Montpellier LIRMM CNRS Montpellier France Univ Toulouse CNRS IRIT Toulouse France Univ Artois CNRS CRIL Lens France

ISBN: (纸本)9783642406263;9783642406270

Some applications require the interactive resolution of a constraint problem by a human user. In such cases, it is highly desirable that the person who interactively solves the problem is not given the choice to select values that do not lead to solutions. We call this property global inverse consistency. Existing systems simulate this either by maintaining arc consistency after each assignment performed by the user or by compiling offline the problem as a multi-valued decision diagram. In this paper, we define several questions related to global inverse consistency and analyse their complexity. Despite their theoretical intractability, we propose several algorithms for enforcing global inverse consistency and we show that the best version is efficient enough to be used in an interactive setting on several configuration and design problems. We finally extend our contribution to the inverse consistency of tuples.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Lifting Structural Tractability to CSP with Global constraints

Lifting Structural Tractability to CSP with Global Constrain...

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： thorstensen, Evgenij Univ Oxford Dept Comp Sci Oxford OX1 2JD England

ISBN: (纸本)9783642406263;9783642406270

A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or implicitly, by special-purpose algorithms provided by a solver. Such implicitly represented constraints, known as global constraints, are widely used;indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. In recent years, a variety of restrictions on the structure of CSP instances that yield tractable classes have been identified. However, many such restrictions fail to guarantee tractability for CSPs with global constraints. In this paper, we investigate the properties of extensionally represented constraints that these restrictions exploit to achieve tractability, and show that there are large classes of global constraints that also possess these properties. this allows us to lift these restrictions to the global case, and identify new tractable classes of CSPs with global constraints.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Program Reasoning with Heaps and Separation

Constraint-Based Program Reasoning with Heaps and Separation

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Duck, Gregory J. Jaffar, Joxan Koh, Nicolas C. H. Natl Univ Singapore Dept Comp Sci Singapore 117548 Singapore

ISBN: (纸本)9783642406263;9783642406270

this paper introduces a constraint language H for finite partial maps (a.k.a. heaps) that incorporates the notion of separation from Separation Logic. We use H to build an extension of Hoare Logic for reasoning over heap manipulating programs using (constraint-based) symbolic execution. We present a sound and complete algorithm for solving quantifier-free (QF) H-formulae based on heap element propagation. An implementation of the H-solver has been integrated into a Satisfiability Modulo theories (SMT) framework. We experimentally evaluate the implementation against Verification Conditions (VCs) generated from symbolic execution of large (heap manipulating) programs. In particular, we mitigate the path explosion problem using subsumption via interpolation - made possible by the constraint-based encoding.

关键词： Heap Manipulating Programs Symbolic Execution Separation Logic Satisfiability Modulo theories constraint Handling Rules

来源：评论

学校读者我要写书评

暂无评论

Dominance Driven Search

Dominance Driven Search

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

Recently, a generic method for identifying and exploiting dominance relations using dominance breaking constraints was proposed. In this method, sufficient conditions for a solution to be dominated are identified and these conditions are used to generate dominance breaking constraints which prune off the dominated solutions. We propose to use these dominance relations in a different way in order to boost the search for good/optimal solutions. In the new method, which we call dominance jumping, when search reaches a point where all solutions in the current domain are dominated, rather than simply backtrack as in the original dominance breaking method, we jump to the subtree which dominates the current subtree. this new strategy allows the solver to move from a bad subtree to a good one, significantly increasing the speed with which good solutions can be found. Experiments across a range of problems show that the method can be very effective when the original search strategy was not very good at finding good solutions.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective constraint Optimization with Tradeoffs

Multi-Objective Constraint Optimization with Tradeoffs

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Marinescu, Radu Razak, Abdul Wilson, Nic IBM Research Ireland Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642406263;9783642406270

In this paper, we consider the extension of multi-objective constraint optimization algorithms to the case where there are additional tradeoffs, reducing the number of optimal solutions. We focus especially on branch-and-bound algorithms which use a mini-buckets algorithm for generating the upper bound at each node (in the context of maximizing values of objectives). Since the main bottleneck of these algorithms is the very large size of the guiding upper bound sets we introduce efficient methods for reducing these sets, yet still maintaining the upper bound property. We also propose much faster dominance checks with respect to the preference relation induced by the tradeoffs. Furthermore, we show that our tradeoffs approach which is based on a preference inference technique can also be given an alternative semantics based on the well known Multi-Attribute Utility theory. Our comprehensive experimental results on common multi-objective constraint optimization benchmarks demonstrate that the proposed enhancements allow the algorithms to scale up to much larger problems than before.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：