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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,005 篇 会议
51 篇 期刊文献
20 册 图书

馆藏范围

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

日期分布

学科分类号

900 篇 工学
- 876 篇 计算机科学与技术...
- 526 篇 软件工程
- 45 篇 信息与通信工程
- 29 篇 电气工程
- 22 篇 控制科学与工程
- 10 篇 机械工程
- 6 篇 建筑学
- 6 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 农业工程
- 5 篇 生物工程
- 4 篇 动力工程及工程热...
- 3 篇 航空宇航科学与技...
- 3 篇 环境科学与工程（可...
551 篇 理学
- 436 篇 数学
- 283 篇 系统科学
- 19 篇 统计学（可授理学、...
- 11 篇 物理学
- 8 篇 生物学
- 5 篇 化学
84 篇 管理学
- 69 篇 管理科学与工程(可...
- 44 篇 工商管理
- 18 篇 图书情报与档案管...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
5 篇 农学
- 5 篇 作物学
2 篇 教育学
- 2 篇 教育学
1 篇 军事学

主题

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

机构

19 篇 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 篇 161 rue ada mont...
6 篇 natl univ singap...
6 篇 univ st andrews ...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 ben gurion univ ...
5 篇 brown univ dept ...
5 篇 department of co...

作者

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

语言

1,070 篇 英文
3 篇 其他
3 篇 中文

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

共 1076 条记录，以下是381-390 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming, CP 2010 - 16th international conference, Proceedings

Principles and Practice of Constraint Programming, CP 2010 -...

引用

16th international conference on principles and practice of constraint programming, CP 2010

ISBN: (纸本)364215395X

the proceedings contain 49 papers. the topics discussed include: constraint-directed search in computational finance and economics;constraints, graphs, algebra, logic, and complexity;testing expressibility is hard;applying constraint programming to identification and assignment of service professionals;computing the density of states of Boolean formulas;towards parallel non serial dynamic programming for solving hard weighted CSP;making adaptive an interval constraint propagation algorithm exploiting monotonicity;checking-up on branch-and-check;spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows;propagating the bin packing constraint using linear programming;sweeping with continuous domains;a new hybrid tractable class of soft constraint problems;a propagator for maximum weight string alignment with arbitrary pairwise dependencies;and generating special-purpose stateless propagators for arbitrary constraints.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A DSL for writing type Systems for Xtext Languages 11

A DSL for writing type Systems for Xtext Languages

引用

9th international conference on principles and practice of programming in Java, PPPJ 2011

作者： Bettini, Lorenzo Dipartimento di Informatica Università di Torino Corso Svizzera 185 10149 Torino Italy

ISBN: (纸本)9781450309356

Xtext is a framework for the development of languages, which also generates all the typical and recurrent artifacts for a fully-fledged IDE on top of Eclipse. the validation (e.g., checking the correctness of programs from the point of view of types) of languages developed in Xtext has to be implemented by the programmer writing Java code. In this paper we present XTypeS (Xtext TypeSystem), a DSL for writing the type system for an Xtext language. A type system definition in XTypeS is a set of rules which act on the elements of the AST of a program, which in Xtext is represented by an EMF model. then, XTypeS will generate the corresponding Java code that can be used to implement the validation part for a language developed in Xtext. We describe the features of XTypeS by writing the type system of two languages implemented in Xtext: Featherweight Java and l-calculus. © 2011 ACM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Tool demonstration: DrHJ - A lightweight pedagogic IDE for habanero Java

Tool demonstration: DrHJ - A lightweight pedagogic IDE for h...

引用

9th international conference on principles and practice of programming in Java, PPPJ 2011

作者： Payne, Jarred Raman, Raghavan Cav´e, Vincent Ricken, Mathias Cartwright, Robert Sarkar, Vivek Department of Computer Science Rice University United States

ISBN: (纸本)9781450309356

the Java language and runtime environment has had a profound worldwide impact on computer software since its introduction nearly two decades ago. It has enabled the creation of a rich ecosystem of libraries, frameworks, and tools that promises to deliver significant value for many years to come. Consequently, a wide range of Interactive Development Environments (IDEs) have emerged to increase the productivity of Java programmers. they vary in functionality based on the expertise level assumed for their target user base. the Eclipse Java Development Tools (JDT) project offers a rich set of power tools for experienced programmers, but can be harder for novice programmers to set up and use. In contrast, IDEs such as DrJava [2] and BlueJ [16] have been developed primarily for use in introductory programming courses. © 2011 ACM.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：