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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Revisiting neighborhood inverse consistency on binary CSPs

Revisiting neighborhood inverse consistency on binary CSPs

引用

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

作者： Woodward, Robert J. Karakashian, Shant Choueiry, Berthe Y. Bessiere, Christian Constraint Systems Laboratory University of Nebraska-Lincoln United States LIRMM-CNRS University of Montpellier France

ISBN: (纸本)9783642335570

Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structure of the dual graph of binary CSPs, and show how it can be arranged in a triangle-shaped grid. We then study, in this context, Relational Neighborhood Inverse Consistency (RNIC), which is a consistency property that we had introduced for non-binary CSPs [17]. We discuss how the structure of the dual graph of binary CSPs affects the consistency level enforced by RNIC. then, we compare, both theoretically and empirically, RNIC to Neighborhood Inverse Consistency (NIC) and strong Conservative Dual Consistency (sCDC), which are higher-level consistency properties useful for solving difficult problem instances. We show that all three properties are pairwise incomparable. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On Backdoors to Tractable constraint Languages

On Backdoors to Tractable Constraint Languages

引用

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

作者： Carbonnel, Clement Cooper, Martin C. Hebrard, Emmanuel CNRS LAAS 7 Ave Colonel Roche F-31400 Toulouse France Univ Toulouse 3 Inst Rech Informat Toulouse F-31062 Toulouse France Univ Toulouse 1 INP Toulouse F-31400 Toulouse France

ISBN: (纸本)9783319104287;9783319104270

In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the property allows efficient solving, then a small strong backdoor provides a reasonable decomposition of the original instance into easy instances. An important challenge is the design of algorithms that can find quickly a small strong backdoor if one exists. We present a systematic study of the parameterized complexity of backdoor detection when the target property is a restricted type of constraint language defined by means of a family of polymorphisms. In particular, we show that under the weak assumption that the polymorphisms are idempotent, the problem is unlikely to be FPT when the parameter is either r (the constraint arity) or k (the size of the backdoor) unless P = NP or FPT = W[2]. When the parameter is k + r, however, we are able to identify large classes of languages for which the problem of finding a small backdoor is FPT.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Parallel SAT solver selection and scheduling

Parallel SAT solver selection and scheduling

引用

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

作者： Malitsky, Yuri Sabharwal, Ashish Samulowitz, Horst Sellmann, Meinolf Cork Constraint Computation Centre University College Cork Ireland IBM Watson Research Center Yorktown Heights NY 10598 United States

ISBN: (纸本)9783642335570

Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition. We show how the approach can be generalized for the parallel case, and how obstacles like parallel SAT solvers and symmetries induced by identical processors can be overcome. We compare different ways of computing parallel solver portfolios with the best performing parallel SAT approaches to date. Extensive experimental results show that the developed methodology very significantly improves our current parallel SAT solving capabilities. © 2012 Springer-Verlag.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A complete characterization of complexity for boolean constraint optimization problems

引用

10th international conference on the principles and practice of constraint programming

作者： Cohen, D Cooper, M Jeavons, P Univ London Royal Holloway Dept Comp Sci London WC1E 7HU England Univ Toulouse 3 IRIT F-31062 Toulouse France Univ Oxford Comp Lab Oxford OX1 2JD England

ISBN: (纸本)3540232419

We analyze the complexity of optimization problems expressed using valued constraints. this very general framework includes a number of well-known optimization problems such as MAX-SAT, and WEIGHTED MAX-SAT, as well as properly generalizing the classical CSP framework by allowing the expression of preferences. We focus on valued constraints over Boolean variables, and we establish a dichotomy theorem which characterizes the complexity of any problem involving a fixed set of constraints of this kind.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：