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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

956 篇 会议
51 篇 期刊文献
19 册 图书

馆藏范围

1,025 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

853 篇 工学
- 833 篇 计算机科学与技术...
- 495 篇 软件工程
- 41 篇 信息与通信工程
- 27 篇 电气工程
- 17 篇 控制科学与工程
- 8 篇 机械工程
- 7 篇 土木工程
- 6 篇 建筑学
- 6 篇 化学工程与技术
- 5 篇 材料科学与工程（可...
- 5 篇 农业工程
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 4 篇 生物工程
- 3 篇 冶金工程
- 3 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 航空宇航科学与技...
530 篇 理学
- 422 篇 数学
- 274 篇 系统科学
- 18 篇 统计学（可授理学、...
- 10 篇 物理学
- 7 篇 生物学
- 6 篇 化学
62 篇 管理学
- 54 篇 管理科学与工程(可...
- 34 篇 工商管理
- 10 篇 图书情报与档案管...
7 篇 法学
- 7 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 农学
- 5 篇 作物学
1 篇 教育学
1 篇 医学
1 篇 军事学

主题

198 篇 constraint theor...
163 篇 constraint satis...
62 篇 constraint progr...
26 篇 constrained opti...
25 篇 computer program...
23 篇 integer programm...
21 篇 answer set progr...
15 篇 logic programmin...
15 篇 artificial intel...
15 篇 scheduling
14 篇 mathematical log...
14 篇 dynamic programm...
13 篇 problem solving
12 篇 linear programmi...
11 篇 global constrain...
11 篇 programming lang...
11 篇 logics and meani...
10 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...

机构

18 篇 natl univ irelan...
18 篇 brown univ provi...
14 篇 univ connecticut...
14 篇 cork constraint ...
10 篇 cork constraint ...
8 篇 univ oxford comp...
7 篇 natl univ irelan...
7 篇 natl univ irelan...
7 篇 department of me...
6 篇 nicta nsw
6 篇 natl univ singap...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 161 rue ada mont...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 univ st andrews ...
5 篇 ben gurion univ ...
5 篇 department of co...
5 篇 univ coll cork c...

作者

31 篇 stuckey peter j.
28 篇 o'sullivan barry
22 篇 van hentenryck p...
20 篇 freuder eugene c...
17 篇 walsh toby
17 篇 quimper claude-g...
15 篇 miguel ian
15 篇 michel laurent
15 篇 bessiere christi...
14 篇 beldiceanu nicol...
14 篇 schaus pierre
14 篇 schulte christia...
12 篇 smith barbara m.
12 篇 hebrard emmanuel
12 篇 pesant gilles
11 篇 régin jean-charl...
11 篇 beck j. christop...
10 篇 hnich brahim
10 篇 gent ian p.
10 篇 rueher michel

语言

1,023 篇 英文
3 篇 中文

检索条件"任意字段=10th International Conference on the Principles and Practice of Constraint Programming"

共 1026 条记录，以下是361-370 订阅

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

详细简洁

排序：

A model seeker: Extracting global constraint models from positive examples

A model seeker: Extracting global constraint models from pos...

引用

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

作者： Beldiceanu, Nicolas Simonis, Helmut Mines de Nantes France Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642335570

We describe a system which generates finite domain constraint models from positive example solutions, for highly structured problems. the system is based on the global constraint catalog, providing the library of constraints that can be used in modeling, and the constraint Seeker tool, which finds a ranked list of matching constraints given one or more sample call patterns. We have tested the modeler with 230 examples, ranging from 4 to 6,500 variables, using between 1 and 7,000 samples. these examples come from a variety of domains, including puzzles, sports-scheduling, packing & placement, and design theory. When comparing against manually specified "canonical" models for the examples, we achieve a hit rate of 50%, processing the complete benchmark set in less than one hour on a laptop. Surprisingly, in many cases the system finds usable candidate lists even when working with a single, positive example. © 2012 Springer-Verlag.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Space-time tradeoffs for the regular constraint

Space-time tradeoffs for the regular constraint

引用

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

作者： Cheng, Kenil C. K. Xia, Wei Yap, Roland H. C. School of Computing National University of Singapore Singapore

ISBN: (纸本)9783642335570

Many global constraints can be described by a regular expression or a DFA. Originally, the regular constraint, uses a DFA to describe the constraint, however, it can also be used to express a table constraint. thus, there are many representations for an equivalent constraint. In this paper, we investigate the effect of different representations on natural extensions of the regular constraint focusing on the space-time tradeoffs. We propose a variant of the regular constraint, nfac(X), where X can be an NFA, DFA or MDD. Our nfac algorithm enforces GAC directly on any of the input representations, thus, generalizing the mddc algorithm. We also give an algorithm to directly convert an NFA representation to an MDD for nfac(MDD) or mddc. Our experiments show that the NFA representation not only saves space but also time. When the ratio of the NFA over the MDD or DFA size is small enough, nfac(NFA) is faster. When the size ratio is larger, nfac(NFA) still saves space and is a bit slower. In some problems, the initialization cost of MDD or DFA can also be a significant overhead, unlike NFA which has low initialization cost. We also show that the effect of the early-cutoff optimization is significant in all the representations. © 2012 Springer-Verlag.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

Containment, equivalence and coreness from CSP to QCSP and beyond

Containment, equivalence and coreness from CSP to QCSP and b...

引用

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

作者： Madelaine, Florent Martin, Barnaby Clermont Université Université d'Auvergne Clermont-Ferrand France France School of Engineering and Computing Sciences Durham University Science Laboratories South Road Durham DH1 3LE United Kingdom

ISBN: (纸本)9783642335570

the constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP ), correspond naturally to the model checking problem for three increasingly stronger fragments of positive first-order logic. their complexity is often studied when parameterised by a fixed model, the so-called template. It is a natural question to ask when two templates are equivalent, or more generally when one "contain" another, in the sense that a satisfied instance of the first will be necessarily satisfied in the second. One can also ask for a smallest possible equivalent template: this is known as the core for CSP. We recall and extend previous results on containment, equivalence and "coreness" for QCSP before initiating a preliminary study of cores for QCSP which we characterise for certain structures and which turns out to be more elusive. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Cardinality reasoning for bin-packing constraint: Application to a tank allocation problem

Cardinality reasoning for bin-packing constraint: Applicatio...

引用

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

作者： Schaus, Pierre Régin, Jean-Charles Van Schaeren, Rowan Dullaert, Wout Raa, Birger ICTEAM Université Catholique de Louvain Belgium University of Nice France Antwerp Maritime Academy Belgium VU University Amsterdam University of Antwerp Netherlands University of Gent Belgium

ISBN: (纸本)9783642335570

Flow reasoning has been successfully used in CP for more than a decade. It was originally introduced by Régin in the well-known Alldifferent and Global Cardinality constraint (GCC) available in most of the CP solvers. the BinPacking constraint was introduced by Shaw and mainly uses an independent knapsack reasoning in each bin to filter the possible bins for each item. this paper considers the use of a cardinality/flow reasoning for improving the filtering of a bin-packing constraint. the idea is to use a GCC as a redundant constraint to the BinPacking that will count the number of items placed in each bin. the cardinality variables of the GCC are then dynamically updated during the propagation. the cardinality reasoning of the redundant GCC makes deductions that the bin-packing constraint cannot see since the placement of all items into every bin is considered at once rather than for each bin individually. this is particularly well suited when a minimum loading in each bin is specified in advance. We apply this idea on a Tank Allocation Problem (TAP). We detail our CP model and give experimental results on a real-life instance demonstrating the added value of the cardinality reasoning for the bin-packing constraint. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Boosting local consistency algorithms over floating-point numbers

Boosting local consistency algorithms over floating-point nu...

引用

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

作者： Belaid, Mohammed Said Michel, Claude Rueher, Michel Les Algorithmes Bât. Euclide B 2000 route des Lucioles 06903 Sophia Antipolis Cedex France

ISBN: (纸本)9783642335570

Solving constraints over floating-point numbers is a critical issue in numerous applications notably in program verification. Capabilities of filtering algorithms over the floating-point numbers ( ) have been so far limited to 2b-consistency and its derivatives. though safe, such filtering techniques suffer from the well known pathological problems of local consistencies, e.g., inability to efficiently handle multiple occurrences of the variables. these limitations also have their origins in the strongly restricted floating-point arithmetic. To circumvent the poor properties of floating-point arithmetic, we propose in this paper a new filtering algorithm, called FPLP, which relies on various relaxations over the real numbers of the problem over . Safe bounds of the domains are computed with a mixed integer linear programming solver (MILP) on safe linearizations of these relaxations. Preliminary experiments on a relevant set of benchmarks are promising and show that this approach can be effective for boosting local consistency algorithms over . © 2012 Springer-Verlag.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Comparing solution methods for the machine reassignment problem

Comparing solution methods for the machine reassignment prob...

引用

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

作者： Mehta, Deepak O'Sullivan, Barry Simonis, Helmut Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642335570

the machine reassignment problem is defined by a set of machines and a set of processes. Each machine is associated with a set of resources, e.g. CPU, RAM etc., and each process is associated with a set of required resource values and a currently assigned machine. the task is to reassign the processes to machines while respecting a set of hard constraints in order to improve the usage of the machines, as defined by a complex cost function. We present a natural constraint programming (CP) formulation of the problem that uses a set of well-known global constraints. However, this formulation also requires new global constraints. Additionally, the instances are so large that systematic search is not practical especially when the time is limited. We therefore developed a CP formulation of the problem that is especially suited for a large neighborhood search approach (LNS). We also experimented with a mixed-integer programming (MIP) model for LNS. We first compare our formulations on a set of ROADEF'12 problem instances where the number of processes and machines are restricted to 1000 and 100 respectively. Both MIP and CP-based LNS approaches find solutions that are significantly better than the initial ones and compare well to other submitted entries. We further investigate their performances on larger instances where the number of processes and machines can be up to 50000 and 5000 respectively. the results suggest that our CP-based LNS can scale to large instances and is superior in memory use and the quality of solutions that can be found in limited time. © 2012 Springer-Verlag.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共103页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：