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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

principles and practice of constraint programming - 19th international conference, cp 2013, Proceedings

Principles and Practice of Constraint Programming - 19th Int...

引用

19th international conference on principles and practice of constraint programming, cp 2013

ISBN: (纸本)9783642406263

the proceedings contain 63 papers. the topics discussed include: a parametric approach for smaller and better encodings of cardinality constraints;automated symmetry breaking and model selection in conjure;MinSAT versus MaxSAT for optimization problems;counting spanning trees to guide search in constrained spanning tree problems;tractable combinations of global constraints;postponing optimization to speed up MAXSAT solving;solving weighted CSPs by successive relaxations;constraint-based program reasoning with heaps and separation;model combinators for hybrid optimization;a simple and effective decomposition for the multidimensional binpacking constraint;maintaining soft arc consistencies in BnB-ADOPT+ during search;solving string constraints: the case for constraint programming;blowing holes in various aspects of computational problems, with applications to constraint satisfaction;and focused random walk with configuration checking and break minimum for satisfiability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Revisiting the Cardinality Reasoning for BinPacking constraint

Revisiting the Cardinality Reasoning for BinPacking Constrai...

引用

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

作者： Pelsser, Francois Schaus, Pierre Regin, Jean-Charles UCLouvain ICTEAM Pl Sainte Barbe 2 B-1348 Louvain Belgium Univ Nice Sophia Antipolis I3S CNRS UMR 6070 Nice France

ISBN: (纸本)9783642406263;9783642406270

In a previous work, we introduced a filtering for the Bin-Packing constraint based on a cardinality reasoning for each bin combined with a global cardinality constraint. We improve this filtering with an algorithm providing tighter bounds on the cardinality variables. We experiment it on the Balanced Academic Curriculum Problems demonstrating the benefits of the cardinality reasoning for such bin-packing problems.

关键词： constraint programming Global constraints Bin-Packing

来源：评论

学校读者我要写书评

暂无评论

Time-Table Extended-Edge-Finding for the Cumulative constraint

Time-Table Extended-Edge-Finding for the Cumulative Constrai...

引用

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

作者： Ouellet, Pierre Quimper, Claude-Guy Univ Laval Quebec City PQ Canada

ISBN: (纸本)9783642406263;9783642406270

We propose a new filtering algorithm for the cumulative constraint. It applies the Edge-Finding, the Extended-Edge-Finding and the Time-Tabling rules in O(kn log n) where k is the number of distinct task heights. By a proper use of tasks decomposition, it enforces the Time-Tabling rule and the Time-Table Extended-Edge-Finding rule. thus our algorithm improves upon the best known Extended-Edge-Finding propagator by a factor of O(log n) while achieving a much stronger filtering.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems

Constraint Based Computation of Periodic Orbits of Chaotic D...

引用

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

作者： Goldsztejn, Alexandre Granvilliers, Laurent Jermann, Christophe CNRS LINA UMR 6241 2 Rue Houssiniere F-44300 Nantes France Univ Nantes LINA UMR 6241 F-44035 Nantes France

ISBN: (纸本)9783642406263;9783642406270

the chaos theory emerged at the end of the 19th century, and it has given birth to a deep mathematical theory in the 20th century, with a strong practical impact (e. g., weather forecast, turbulence analysis). Periodic orbits play a key role in understanding chaotic systems. their rigorous computation provides some insights on the chaotic behavior of the system and it enables computer assisted proofs of chaos related properties (e. g., topological entropy). In this paper, we show that the (numerical) constraint programming framework provides a very convenient and efficient method for computing periodic orbits of chaotic dynamical systems: Indeed, the flexibility of cp modeling allows considering various models as well as including additional constraints (e. g., symmetry breaking constraints). Furthermore, the richness of the different solving techniques (tunable local propagators, search strategies, etc.) leads to highly efficient computations. these strengths of the cp framework are illustrated by experimental results on classical chaotic systems from the literature.

关键词： Chaotic dynamical systems periodic orbits topological entropy numerical constraint satisfaction symmetry breaking

来源：评论

学校读者我要写书评

暂无评论

A Simple and Effective Decomposition for the Multidimensional Binpacking constraint

A Simple and Effective Decomposition for the Multidimensiona...

引用

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

作者： Gualandi, Stefano Lombardi, Michele Univ Pavia Dipartimento Matemat I-27100 Pavia Italy Univ Bologna Dipartimento Informat Sci & Ingn Bologna Italy

ISBN: (纸本)9783642406263;9783642406270

the multibin_packing constraint captures a fundamental substructure of many assignment problems, where a set of items, each with a fixed number of dimensions, must be assigned to a number of bins with limited capacities. In this work we propose a simple decomposition for multibin_packing that uses a bin packing constraint for each dimension, a set of all different constraints automatically derived from a conflict graph, plus two alternative symmetry breaking approaches. Despite its simplicity, the proposed decomposition is very effective on a number of instances recently proposed in the literature.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Solving String constraints: the Case for constraint programming

Solving String Constraints: The Case for Constraint Programm...

引用

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

作者： He, Jun Flener, Pierre Pearson, Justin Zhang, Wei Ming Uppsala Univ Dept Informat Technol Uppsala Sweden Natl Univ Def Technol Sch Informat Syst & Management Changsha Hunan Peoples R China

ISBN: (纸本)9783642406263;9783642406270

We improve an existing propagator for the context-free grammar constraint and demonstrate experimentally the practicality of the resulting propagator. the underlying technique could be applied to other existing propagators for this constraint. We argue that constraint programming solvers are more suitable than existing solvers for verification tools that have to solve string constraints, as they have a rich tradition of constraints for membership in formal languages.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Large Neighborhood Search

Multi-Objective Large Neighborhood Search

引用

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

作者： Schaus, Pierre Hartert, Renaud UCLouvain ICTEAM B-1348 Louvain Belgium

ISBN: (纸本)9783642406263;9783642406270

Large neighborhood search (LNS) [25] is a framework that combines the expressiveness of constraint programming with the efficiency of local search to solve combinatorial optimization problems. this paper introduces an extension of LNS, called multi-objective LNS (MO-LNS), to solve multi-objective combinatorial optimization problems ubiquitous in practice. the idea of MO-LNS is to maintain a set of nondominated solutions rather than just one best-so-far solution. At each iteration, one of these solutions is selected, relaxed and optimized in order to strictly improve the hypervolume of the maintained set of nondominated solutions. We introduce modeling abstractions into the OscaR solver for MO-LNS and show experimentally the efficiency of this approach on various multi-objective combinatorial optimization problems.

关键词： constraint programming Multi-Objective Combinatorial Optimization Large Neighborhood Search

来源：评论

学校读者我要写书评

暂无评论

Bandit-Based Search for constraint programming

Bandit-Based Search for Constraint Programming

引用

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

作者： Loth, Manuel Sebag, Michele Hamadi, Youssef Schoenauer, Marc Microsoft Res INRIA Joint Ctr Palaiseau France Univ Paris Sud LRI TAO CNRSINRIA Orsay France Microsoft Res Cambridge England

ISBN: (纸本)9783642406263;9783642406270

constraint programming (cp) solvers classically explore the solution space using tree-search based heuristics. Monte-Carlo Tree Search (MCTS), aimed at optimal sequential decision making under uncertainty, gradually grows a search tree to explore the most promising regions according to a specified reward function. At the crossroad of cp and MCTS, this paper presents the Bandit Search for constraint programming (BASCOP) algorithm, adapting MCTS to the specifics of the cp search. this contribution relies on i) a generic reward function suited to cp and compatible with a multiple restart strategy;ii) the use of depth-first search as roll-out procedure in MCTS. BASCOP, on the top of the Gecode constraint solver, is shown to significantly improve on depth-first search on some cp benchmark suites, demonstrating its relevance as a generic yet robust cp search method.

关键词： adaptive search value selection bandit UCB MCTS

来源：评论

学校读者我要写书评

暂无评论

Model Combinators for Hybrid Optimization

Model Combinators for Hybrid Optimization

引用

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

作者： Fontaine, Daniel Michel, Laurent Van Hentenryck, Pascal Univ Connecticut Storrs CT 06269 USA Univ Melbourne NICTA Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

In recent years, CML, G12 and SIMPL, have achieved significant progress in automating the generation of hybrid solvers from high-level model specifications. this paper pushes this research direction one step further and introduces the concept of model combinators to provide principled model compositions. these model combinators rely on runnables capturing executable models, runnable signatures that capture what runnables can produce and consume, and model hierarchies, which track relationships among models. these concepts make it possible to enforce the soundness of model compositions and to determine the best model compositions automatically. A prototype of the framework on top of the Objective-cp optimization system is presented.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems

Counting Spanning Trees to Guide Search in Constrained Spann...

引用

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

作者： Brockbank, Simon Pesant, Gilles Rousseau, Louis-Martin École Polytechnique de Montréal Montreal QC Canada CIRRELT Université de Montréal Montreal QC Canada

ISBN: (纸本)9783642406263;9783642406270

Counting-based branching heuristics such as maxSD were shown to be effective on a variety of constraint satisfaction problems. these heuristics require that we equip each family of constraints with a dedicated algorithm to compute the local solution density of variable assignments, much as what has been done with filtering algorithms to apply local inference. this paper derives an exact polytime algorithm to compute solution densities for a spanning tree constraint, starting from a known result about the number of spanning trees in a graph. We then empirically compare branching heuristics based on that result with other generic heuristics.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：