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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

309 篇 会议
8 册 图书
6 篇 期刊文献

馆藏范围

322 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

274 篇 工学
- 267 篇 计算机科学与技术...
- 165 篇 软件工程
- 27 篇 信息与通信工程
- 19 篇 电气工程
- 4 篇 化学工程与技术
- 3 篇 动力工程及工程热...
- 3 篇 土木工程
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 石油与天然气工程
192 篇 理学
- 143 篇 数学
- 116 篇 系统科学
- 7 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 化学
- 3 篇 生物学
- 1 篇 地球物理学
24 篇 管理学
- 22 篇 管理科学与工程(可...
- 15 篇 工商管理
- 3 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

64 篇 constraint theor...
52 篇 constraint satis...
31 篇 constraint progr...
11 篇 constrained opti...
8 篇 problem solving
7 篇 scheduling
6 篇 mathematical log...
5 篇 artificial intel...
4 篇 modeling languag...
4 篇 model checking
4 篇 optimization
4 篇 programming lang...
4 篇 logics and meani...
3 篇 polynomial appro...
3 篇 constraint handl...
3 篇 semantics
3 篇 algorithm analys...
3 篇 regular constrai...
2 篇 solution countin...
2 篇 software enginee...

机构

5 篇 cork constraint ...
5 篇 cork constraint ...
4 篇 ecole polytech m...
4 篇 fraunhofer first...
4 篇 natl univ irelan...
4 篇 kth royal inst t...
4 篇 mines de nantes
4 篇 brown univ provi...
3 篇 univ bologna dei...
3 篇 nicta nsw
3 篇 university of co...
3 篇 161 rue ada mont...
3 篇 iiia-csic campus...
3 篇 univ connecticut...
3 篇 natl univ irelan...
3 篇 univ coll cork c...
3 篇 univ london impe...
3 篇 univ toronto dep...
2 篇 lund university ...
2 篇 university of pa...

作者

16 篇 stuckey peter j.
11 篇 o'sullivan barry
9 篇 bessiere christi...
8 篇 miguel ian
8 篇 beldiceanu nicol...
8 篇 hebrard emmanuel
8 篇 pesant gilles
7 篇 van hentenryck p...
7 篇 walsh toby
7 篇 schulte christia...
7 篇 quimper claude-g...
6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 choueiry berthe ...
6 篇 simonis helmut
6 篇 schaus pierre
5 篇 rousseau louis-m...
5 篇 hnich brahim
5 篇 deville yves
5 篇 bessière christi...

语言

322 篇 英文
1 篇 中文

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

共 323 条记录，以下是131-140 订阅

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

详细简洁

排序：

Scheduling scientific experiments on the rosetta/philae mission

Scheduling scientific experiments on the rosetta/philae miss...

引用

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

作者： Simonin, Gilles Artigues, Christian Hebrard, Emmanuel Lopez, Pierre CNRS LAAS 7 avenue du colonel Roche Toulouse F-31400 France Univ de Toulouse LAAS Toulouse F-31400 France

ISBN: (纸本)9783642335570

the Rosetta/Philae mission was launched in 2004 by the European Space Agency (ESA). It is scheduled to reach the comet 67P/Churyumov-Gerasimenko in 2014 after traveling more than six billion kilometers. the Philae module will then be separated from the orbiter (Rosetta) to attempt the first ever landing on the surface of a comet. If it succeeds, it will engage a sequence of scientific exploratory experiments on the comet. In this paper we describe a constraint programming model for scheduling the different experiments of the mission. A feasible plan must satisfy a number of constraints induced by energetic resources, precedence relations on activities, or incompatibility between instruments. Moreover, a very important aspect is related to the transfer (to the orbiter then to the Earth) of all the data produced by the instruments. the capacity of inboard memories and the limitation of transfers within visibility windows between lander and orbiter, make the transfer policy implemented on the lander's cpU prone to data loss. We introduce a global constraint to handle data transfers. the goal of this constraint is to ensure that data-producing activities are scheduled in such a way that no data is lost. thanks to this constraint and to the filtering rules we propose, mission control is now able to compute feasible plans in a few seconds for scenarios where minutes were previously often required. Moreover, in many cases, data transfers are now much more accurately simulated, thus increasing the reliability of the plans. © 2012 Springer-Verlag.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Interactive algorithm for multi-objective constraint optimization

Interactive algorithm for multi-objective constraint optimiz...

引用

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

作者： Okimoto, Tenda Joe, Yongjoon Iwasaki, Atsushi Matsui, Toshihiro Hirayama, Katsutoshi Yokoo, Makoto Kyushu University Fukuoka 8190395 Japan Nagoya Insutitute of Technology Nagoya 4668555 Japan Kobe University Kobe 6580022 Japan

ISBN: (纸本)9783642335570

Many real world problems involve multiple criteria that should be considered separately and optimized simultaneously. A Multi-Objective constraint Optimization Problem (MO-COP) is the extension of a mono-objective constraint Optimization Problem (COP). In a MO-COP, it is required to provide the most preferred solution for a user among many optimal solutions. In this paper, we develop a novel Interactive Algorithm for MO-COP (MO-IA). the characteristics of this algorithm are as follows: (i) it can guarantee to find a Pareto solution, (ii) it narrows a region, in which Pareto front may exist, gradually, (iii) it is based on a pseudo-tree, which is a widely used graph structure in COP algorithms, and (iv) the complexity of this algorithm is determined by the induced width of problem instances. In the evaluations, we use an existing model for representing a utility function, and show empirically the effectiveness of our algorithm. Furthermore, we propose an extension of MO-IA, which can provide the more detailed information for Pareto front. © 2012 Springer-Verlag.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Propagating soft table constraints

Propagating soft table constraints

引用

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

作者： Lecoutre, Christophe Paris, Nicolas Roussel, Olivier Tabary, Sébastien CRIL - CNRS UMR 8188 Univ. Lille Nord de France Artois F-62307 Lens France

ISBN: (纸本)9783642335570

WCSP is a framework that has attracted a lot of attention during the last decade. In particular, many filtering approaches have been developed on the concept of equivalence-preserving transformations (cost transfer operations), using the definition of soft local consistencies such as, for example, node consistency, arc consistency, full directional arc consistency, and existential directional arc consistency. Almost all algorithms related to these properties have been introduced for binary weighted constraint networks, and most of the conducted experiments typically include networks with binary and ternary constraints only. In this paper, we focus on extensional soft constraints (of large arity), so-called soft table constraints. We propose an algorithm to enforce a soft version of generalized arc consistency (GAC) on such constraints, by combining both the techniques of cost transfer and simple tabular reduction, the latter dynamically maintaining the list of allowed tuples in constraint tables. On various series of problem instances containing soft table constraints of large arity, we show the practical interest of our approach. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Properties of energy-price forecasts for scheduling

Properties of energy-price forecasts for scheduling

引用

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

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

ISBN: (纸本)9783642335570

Wholesale electricity markets are becoming ubiquitous, offering consumers access to competitively-priced energy. the cost of energy is often correlated with its environmental impact;for example, environmentally sustainable forms of energy might benefit from subsidies, while the use of high-carbon sources might be discouraged through taxes or levies. Reacting to real-time electricity price fluctuations can lead to high cost savings, in particular for large energy consumers such as data centres or manufacturing plants. In this paper we focus on the challenge of day-ahead energy price prediction, using the Irish Single Electricity Market Operator (SEMO) as a case-study. We present techniques that significantly out-perform SEMO's own prediction. We evaluate the energy savings that are possible in a production scheduling context, but show that better prediction does not necessarily yield energy-cost savings. We explore this issue further and characterize, and evaluate, important properties that an energy price predictor must have in order to give rise to significant scheduling-cost savings in practice. © 2012 Springer-Verlag.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Increasing symmetry breaking by preserving target symmetries

Increasing symmetry breaking by preserving target symmetries

引用

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

作者： Lee, Jimmy H. M. Li, Jingying Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong

ISBN: (纸本)9783642335570

Breaking the exponential number of all symmetries of a constraint satisfaction problem is often too costly. In practice, we often aim at breaking a subset of the symmetries efficiently, which we call target symmetries. In static symmetry breaking, the goal is to post a set of constraints to break these target symmetries in order to reduce the solution set and thus also the search space. Symmetries of a problem are all intertwined. A symmetry breaking constraint intended for a particular symmetry almost always breaks more than just the intended symmetry as a side-effect. Different constraints for breaking the same target symmetry can have different side-effects. Conventional wisdom suggests that we should select a symmetry breaking constraint that has more side-effects by breaking more symmetries. While this wisdom is valid in many ways, we should be careful where the side-effects take place. A symmetry σ of a CSP P=(V,D,C) is preserved by a set of symmetry breaking constraints Csb iff σ is a symmetry of P=(V,D,CUCsb). We give theorems and examples to demonstrate that it is beneficial to post symmetry breaking constraints that preserve the target symmetries and restrict the side-effects to only non-target symmetries as much as possible. the benefits are in terms of the number of symmetries broken and the extent to which a symmetry is broken (or eliminated), resulting in a smaller solution set and search space. Extensive experiments are also conducted to confirm the feasibility and efficiency of our proposal empirically. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Weibull-based benchmarks for bin packing

Weibull-based benchmarks for bin packing

引用

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

作者： Castiñeiras, Ignacio De Cauwer, Milan O'Sullivan, Barry Dpto. de Sistemas Informáticos Y Computación Universidad Complutense de Madrid Spain Département Informatique Université de Nantes France Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642335570

Bin packing is a ubiquitous problem that arises in many practical applications. the motivation for the work presented here comes from the domain of data centre optimisation. In this paper we present a parameterisable benchmark generator for bin packing instances based on the well-known Weibull distribution. Using the shape and scale parameters of this distribution we can generate benchmarks that contain a variety of item size distributions. We show that real-world bin packing benchmarks can be modelled extremely well using our approach. We also study both systematic and heuristic bin packing methods under a variety of Weibull settings. We observe that for all bin capacities, the number of bins required in an optimal solution increases as the Weibull shape parameter increases. However, for each bin capacity, there is a range of Weibull shape settings, corresponding to different item size distributions, for which bin packing is hard for a cp-based method. © 2012 Springer-Verlag.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Octagonal domains for continuous constraints

Octagonal domains for continuous constraints

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Pelleau, Marie Truchet, Charlotte Benhamou, Frédéric LINA UMR CNRS 6241 Université de Nantes France

ISBN: (纸本)9783642237850

Domains in Continuous constraint programming (cp) are generally represented with intervals whose n-ary Cartesian product (box) approximates the solution space. this paper proposes a new representation for continuous variable domains based on octagons. We generalize local consistency and split to this octagon representation, and we propose an octagonal-based branch and prune algorithm. Preliminary experimental results show promising performance improvements on several classical benchmarks. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Operations research and constraint programming at google 17th

Operations research and constraint programming at google

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Perron, Laurent Google SA 38 avenue de l’opéra Paris75002 France

ISBN: (纸本)9783642237850

the Operations Research and Optimization team at Google develops both general purpose optimization tools and solutions for internal optimization problems. We will describe the tools – most of which are available at http://***/p/or-tools – and present a few applications, for example in the area of assigning jobs to machines. Furthermore, we will discuss our usage of constraint programming in greater detail, and how it fits into the general usage of Operations Research at Google. Finally, we will also share our future plans. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Operations research

来源：评论

学校读者我要写书评

暂无评论

A Θ(n) bound-consistency algorithm for the increasing sum constraint

A Θ(n) bound-consistency algorithm for the increasing sum c...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Petit, thierry Régin, Jean-Charles Beldiceanu, Nicolas Mines de Nantes France I3S UMR 6070 CNRS Université de Nice-Sophia Antipolis France

Given a sequence of variables X = 〈x 0, x 1, …, xn − 1 〉, we consider the IncreasingSum constraint, which imposes ∀ i ∈ [0, n − 2] xi ≤ xi + 1, and Σxi∈X xi = S. We propose an Θ(n) bound-consistency algorit... 详细信息

ISBN: (纸本)9783642237850

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Revisiting the tree constraint

Revisiting the tree constraint

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Fages, Jean-Guillaume Lorca, Xavier École des Mines de Nantes INRIA LINA UMR CNRS 6241 Nantes Cedex 3FR-44307 France

ISBN: (纸本)9783642237850

this paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roots. We introduce a new filtering algorithm that enforces generalized arc-consistency in O(n + m) time while the original filtering algorithm reaches O(nm) time. this result allows to tackle larger scale problems involving graph partitioning. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：