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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

61 篇 会议
4 册 图书

馆藏范围

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

日期分布

学科分类号

49 篇 理学
- 40 篇 系统科学
- 28 篇 数学
- 2 篇 化学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
49 篇 工学
- 47 篇 计算机科学与技术...
- 40 篇 软件工程
- 4 篇 信息与通信工程
- 2 篇 化学工程与技术
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 控制科学与工程
- 1 篇 石油与天然气工程
- 1 篇 环境科学与工程（可...
9 篇 管理学
- 8 篇 管理科学与工程(可...
- 5 篇 工商管理
- 2 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学

主题

16 篇 constraint theor...
9 篇 constraint satis...
6 篇 constraint progr...
3 篇 constrained opti...
3 篇 mathematical log...
3 篇 programming lang...
3 篇 logics and meani...
2 篇 model checking
2 篇 computational ge...
2 篇 discrete mathema...
2 篇 numeric computin...
2 篇 distributed cons...
2 篇 scheduling
2 篇 cryptography
2 篇 algorithm analys...
1 篇 smart homes
1 篇 traveling salesm...
1 篇 learning systems
1 篇 frequency alloca...
1 篇 computational co...

机构

3 篇 cork constraint ...
3 篇 cork constraint ...
2 篇 university of co...
2 篇 optimization res...
2 篇 mines de nantes
2 篇 national ict aus...
2 篇 brown univ provi...
2 篇 icteam universit...
1 篇 free univ amster...
1 篇 sics lagerhyddsv...
1 篇 department of op...
1 篇 antwerp maritime...
1 篇 irit university ...
1 篇 university of ge...
1 篇 university of co...
1 篇 florida inst tec...
1 篇 cermics 2004 rou...
1 篇 sics kista 16429
1 篇 department of co...
1 篇 nicta unsw

作者

6 篇 beldiceanu nicol...
5 篇 carlsson mats
4 篇 stuckey peter j.
4 篇 o'sullivan barry
3 篇 van hentenryck p...
3 篇 simonis helmut
3 篇 michel laurent
2 篇 pearson justin
2 篇 solnon christine
2 篇 dullaert wout
2 篇 hirayama katsuto...
2 篇 rueher michel
2 篇 matsui toshihiro
2 篇 cooper martin c.
2 篇 laviolette franç...
2 篇 chu geoffrey
2 篇 michel laurent d...
2 篇 van schaeren row...
2 篇 hebrard emmanuel
2 篇 flener pierre

语言

64 篇 英文
1 篇 中文

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

共 65 条记录，以下是1-10 订阅

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

详细简洁

排序：

principles and practice of constraint programming - 18th international conference, cp 2012, Proceedings

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

引用

18th international conference on principles and practice of constraint programming, cp 2012

ISBN: (纸本)9783642335570

the proceedings contain 71 papers. the topics discussed include: constraint programming and a usability quest;optimization challenges in smart grid operations;where are the interesting problems?;a generic method for identifying and exploiting dominance relations;scheduling scientific experiments on the Rosetta/Philae mission;an optimal arc consistency algorithm for a chain of atmost constraints with cardinality;conflict directed lazy decomposition;boosting local consistency algorithms over floating-point numbers;a model seeker: extracting global constraint models from positive examples;on computing minimal equivalent subformulas;Weibull-based benchmarks for bin packing;space-time tradeoffs for the regular constraint;inter-instance nogood learning in constraint programming;a characterization of the complexity of forbidding subproblems in binary max-CSP;and optimization modeling for software developers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Where are the interesting problems?

Where are the interesting problems?

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： O'Sullivan, Barry Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642335570

constraint programming has become an important technology for solving hard combinatorial problems in a diverse range of application domains. It has its roots in artificial intelligence, mathematical programming, operations research, and programming languages. In this talk we will discuss a number of challenging application domains for constraint programming, and the technical challenges that these present to the research community. © 2012 Springer-Verlag.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Michela Milano

ISBN: (数字)9783642335587

ISBN: (纸本)9783642335570

this book constitutes the thoroughly refereed post-conference proceedings of the 18th international conference on principles and practice of constraint programming (cp 2012), held in Québec, Canada, in October 2012. the 68 revised full papers were carefully selected from 186 submissions. Beside the technical program, the conference featured two special tracks. the former was the traditional application track, which focused on industrial and academic uses of constraint technology and its comparison and integration with other optimization techniques (MIP, local search, SAT, etc.) the second track, featured for the first time in 2012, concentrated on multidisciplinary papers: cross-cutting methodology and challenging applications collecting papers that link cp technology with other techniques like machine learning, data mining, game theory, simulation, knowledge compilation, visualization, control theory, and robotics. In addition, the track focused on challenging application fields with a high social impact such as cp for life sciences, sustainability, energy efficiency, web, social sciences, finance, and verification.

关键词： Mathematical Logic and Formal Languages Numeric Computing Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Discrete Mathematics in Computer Science programming Languages, Compilers, Interpreters

来源：评论

学校读者我要写书评

暂无评论

constraint programming and a usability quest

Constraint programming and a usability quest

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Michel, Laurent D. University of Connecticut Storrs CT 06269-2155 United States

ISBN: (纸本)9783642335570

In 2004, Jean-Francois Puget presented [2] an analysis of the "simplicity of Use" of constraint programming from which he articulated a series of challenges to make constraint programming systems accessible and easier to use. the core of the argument was a contrast between mathematical programming and constraint programming tools. Mathematical programming adopts a model and run paradigm, rely on a simple vocabulary to model problems (i.e., linear constraints), support standard formats for sharing models and benefit from extensive documentation on how to model [5]. constraint programming features a model and search paradigm, rich modeling languages with combinatorial objects and has a distinctive flavor of programming. While it can be construed as cp's Achilles' heel, it is also its most potent strength and is supported by modeling aids [3,4]. the very existence of sophisticated parameter tuning solutions for SAT solvers and Math programming solvers to determine ideal parameters (e.g., ParamILS [1]) certainly cast a major shadow on the potency of the model and run mantra that is evolving into model and search for the right parameters. © 2012 Springer-Verlag.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

the offshore resources scheduling problem: Detailing a constraint programming approach

The offshore resources scheduling problem: Detailing a const...

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Serra, thiago Nishioka, Gilberto Marcellino, Fernando J. M. PETROBRAS - Petróleo Brasileiro S.A. Avenida Paulista 901 São Paulo SP 01311-100 Brazil

ISBN: (纸本)9783642335570

the development of maritime oil wells depends on the availability of specialized fleet capable of performing the required activities. In addition, the exploitation of each well can only start when it is connected through pipes to a producing unit. the Offshore Resources Scheduling Problem (ORSP) combines such restrictions with the aim to prioritize development projects of higher return in oil production. In this work, an extended description of the ORSP is tackled with constraint programming (cp). Such extension refers to the customization of pipes and to the scheduling of fleet maintenance periods. the use of cp is due to the noted ability of the technique to model and solve large and complex scheduling problems. For the type of scenarios faced by Petrobras, the reported approach was able to quickly deliver good-quality solutions. © 2012 Springer-Verlag.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Christian Schulte

ISBN: (数字)9783642406270

ISBN: (纸本)9783642406263

this book constitutes the refereed conference proceedings of the 18th international conference on principles and practice of constraint programming (cp 2013), held in Uppsala, Sweden, in September 2013. the 61 revised papers presented together with 3 invited talks were carefully selected from 138 submissions. the scope of the conference is on all aspects of computing with constraints, including: theory, algorithms, environments, languages, models and systems, applications such as decision making, resource allocation, and agreement technologies.

来源：评论

学校读者我要写书评

暂无评论

cp(graph): Introducing a graph computation domain in constraint programming

引用

11th international conference on principles and practice of constraint programming (cp 2005)

作者： Dooms, G Deville, Y Dupont, P Univ Catholique Louvain Dept Comp Sci & Engn B-1348 Louvain Belgium

ISBN: (纸本)3540292381

In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be translated to constrained subgraph finding. Our approach extends constraint programming by introducing cp(Graph), a new computation domain focused on graphs including a new type of variable: graph domain variables as well as constraints over these variables and their propagators. these constraints are subdivided into kernel constraints and additional constraints formulated as networks of kernel constraints. For some of these constraints a dedicated global constraint and its associated propagator are sketched. cp(Graph) is integrated with finite domain and finite sets computation domains, allowing the combining of constraints of these domains with graph constraints. A prototype of cp(Graph) built over finite domains and finite sets in Oz is presented. And we show that a problem of biochemical network analysis can be very simply described and solved within cp(Graph).

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Inter-instance nogood learning in constraint programming

Inter-instance nogood learning in constraint programming

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Chu, Geoffrey Stuckey, Peter J. National ICT Australia Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9783642335570

Lazy Clause Generation is a powerful approach to reducing search in constraint programming. this is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators called nogoods. this dramatically reduces the search and provides orders of magnitude speedups on a wide range of problems. Current implementations of Lazy Clause Generation only allows solvers to learn and utilize nogoods within an individual problem. this means that everything the solver learns will be forgotten as soon as the current problem is finished. In this paper, we show how Lazy Clause Generation can be extended so that nogoods learned from one problem can be retained and used to significantly speed up the solution of other, similar problems. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A constraint on the Number of Distinct Vectors with Application to Localization

A Constraint on the Number of Distinct Vectors with Applicat...

引用

15th international conference on principles and practice of constraint programming (cp 2009)

作者： Chabert, Gilles Jaulin, Luc Lorca, Xavier CNRS LINA Ecole Mines Nantes UMR 6241 4 Rue Alfred Kastler F-44300 Nantes France ENSIETA F-29806 Brest 9 France

ISBN: (纸本)9783642042430

this paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables. the generalized constraint (called nvector) bounds the number of distinct;vectors. the first contribution of this paper is to show that this global constraint has a significant role to play with continuous domains, by taking the example of simultaneous localization and map building (SLAM). this type of problem arises in the context, of mobile robotics. the second contribution is, to prove that enforcing bound consistency on this constraint is NP-complete. A simple contractor (or propagator) is proposed and applied on a real application.

关键词： Robotics

来源：评论

学校读者我要写书评

暂无评论

Linking Prefixes and Suffixes for constraints Encoded Using Automata with Accumulators

Linking Prefixes and Suffixes for Constraints Encoded Using ...

引用

20th international conference on the principles and practice of constraint programming (cp)

作者： Beldiceanu, Nicolas Carlsson, Mats Flener, Pierre Rodriguez, Maria Andreina Francisco Pearson, Justin CNRS INRIA TASC Team Mines Nantes F-44307 Nantes France SICS Kista 16429 Sweden Uppsala Univ Dept Informat Technol Uppsala 75105 Sweden

ISBN: (纸本)9783319104287;9783319104270

Consider a constraint on a sequence of variables functionally determining a result variable that is unchanged under reversal of the sequence. Most such constraints have a compact encoding via an automaton augmented with accumulators, but it is unknown how to maintain domain consistency efficiently for most of them. Using such an automaton for such a constraint, we derive an implied constraint between the result variables for a sequence, a prefix thereof, and the corresponding suffix. We show the usefulness of this implied constraint in constraint solving, both by local search and by propagation-based systematic search.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：