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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

principles and practice of constraint programming 2008

引用

丛书名： Lecture Notes in Computer Science

2008年

作者： Peter J. Stuckey

ISBN: (数字)9783540859581

ISBN: (纸本)9783540859574

this book constitutes the refereed proceedings of the 14th international conference on principles and practice of constraint programming, cp 2008, Sydney, Australia, September, 2008. the 27 revised full papers and 23 revised short papers presented together with 6 application papers and the abstracts of one invited lecture were carefully reviewed and selected from 120 submissions. All current issues of computing with constraints are addressed, ranging from methodological and foundational aspects - using algorithms, environments, languages, models and systems - to solving real-world problems in various application fields.

关键词： constraint programming (Computer science) Congresses.

来源：评论

学校读者我要写书评

暂无评论

Leximin Asymmetric Multiple Objective DCOP on Factor Graph 18th

Leximin Asymmetric Multiple Objective DCOP on Factor Graph

引用

18th international conference on principles and practice of Multi-Agent Systems (PRIMA)

作者： Matsui, Toshihiro Silaghi, Marius Okimoto, Tenda Hirayama, Katsutoshi Yokoo, Makoto Matsuo, Hiroshi Nagoya Inst Technol Nagoya Aichi 4668555 Japan Florida Inst Technol Melbourne FL 32901 USA Kobe Univ Kobe Hyogo 6580022 Japan Kyushu Univ Fukuoka 8190395 Japan

ISBN: (纸本)9783319255248;9783319255231

Leximin AMODCOP has been proposed as a class of Multiple Objective Distributed constraint Optimization Problems, where multiple objectives for individual agents are optimized based on the leximin operator. this problem also relates to Asymmetric DCOPs with the criteria of fairness among agents, which is an important requirement in practical resource allocation tasks. Previous studies explore only Leximin AMODCOPs on constraint graphs limited to functions with unary or binary scopes. We address the Leximin AMODCOPs on factor graphs that directly represent n-ary functions. A dynamic programming method on factor graphs is investigated as an exact solution method. In addition, for relatively dense problems, we also investigate several inexact algorithms.

关键词： Distributed constraint optimization Asymmetric Multiple objectives Leximin Egalitarian

来源：评论

学校读者我要写书评

暂无评论

constraints in Software Testing, Verification and Analysis CSTVA 2013

Constraints in Software Testing, Verification and Analysis C...

引用

6th IEEE international conference on Software Testing, Verification and Validation (ICST)

作者： Cadar, Cristian Dadeau, Frederic Univ London Imperial Coll Sci Technol & Med South Kensington Campus London SW7 2AZ England INRIA CASSIS FEMTO ST Inst F-25030 Besancon France

ISBN: (纸本)9780769549934;9781479913244

Recent years have seen an increasing interest in the application of constraint solving techniques to test, verify and analyze software systems. A significant body of constraint-based techniques has been proposed and investigated in the context of test input generation, model-based testing, symbolic execution, static analysis, program verification, and many other areas. these techniques use or extend constraint solvers such as SAT and SMT solvers to reason about boolean, integer, real and floating-point data types, as well as complex data structures, control structures, method calls and other program features. the constraint systems that result from this work usually share many common features and are relevant to a variety of application domains. Following a first meeting held with the principles and practice of constraint programming (cp) conference in 2006, and three subsequent meetings at the international conference on Software Testing, Verification and Validation (ICST) in 2010, 2011 and 2012, the aim of this paper is to bring together researchers and practitioners working in constraint-based software testing, verification and analysis, to investigate future developments in this research field.

关键词： constraint handling formal verification program testing

来源：评论

学校读者我要写书评

暂无评论

Pruning for the minimum constraint family and for the number of distinct values constraint family 1

引用

7th international conference on principles and practice of constraint programming, cp 2001

作者： Beldiceanu, Nicolas SICS Lägerhyddsvägen 18 UppsalaSE-75237 Sweden

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

the paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the number of distinct values constraint. this is a quite common counting constraint that one encounters in many practical applications such as timetabling or frequency allocation problems. A second important contribution is to provide a pruning algorithm for the constraint "at most n distinct values for a set of variables". this can be considered as the counterpart of Regin’s algorithm for the alldifferent constraint where one enforces having at least n distinct values for a given set of n variables. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Frequency allocation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Large Neighborhood Search for Robust Solutions for constraint Satisfaction Problems with Ordered Domains 28

Large Neighborhood Search for Robust Solutions for Constrain...

引用

28th international conference on principles and practice of constraint programming, cp 2022

作者： López, Jheisson Arbelaez, Alejandro Climent, Laura University College Cork School of Computer Science Ireland SFI Centre for Research Training in Artificial Intelligence Cork Ireland Department of Computer Engineering Autonomous University of Madrid Spain

ISBN: (纸本)9783959772402

Often, real-world constraint Satisfaction Problems (CSPs) are subject to uncertainty/dynamism not known in advance. Some techniques in the literature offer robust solutions for CSPs. Here, we analyze a previous exact/complete approach from the state-of-the-art that focuses on CSPs with ordered domains and dynamic bounds. However, this approach has low performance in large-scale CSPs. For this reason, in this paper, we present an inexact/incomplete approach that is faster at finding robust solutions for large-scale CSPs. It is useful when the computation time available for finding a solution is limited and/or in situations where a new one must be re-computed online because the dynamism invalidated the original one. Specifically, we present a Large Neighbourhood Search (LNS) algorithm combined with constraint programming (cp) and Branch-and-bound (B&B) that searches for robust solutions. We also present a robust-value selection heuristic that guides the search toward more promising branches. We evaluate our approach with large-scale CSPs instances, including the case study of scheduling problems. the evaluation shows a considerable improvement in the robustness of the solutions achieved by our algorithm for large-scale CSPs. © Jheisson López, Alejandro Arbelaez, and Laura Climent.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

abstractXOR: A global constraint dedicated to differential cryptanalysis 26th

abstractXOR: A global constraint dedicated to differential c...

引用

26th international conference on principles and practice of constraint programming, cp 2020

作者： Rouquette, Loïc Solnon, Christine CITI INRIA INSA Lyon Villeurbanne69621 France LIRIS UMR5201 CNRS Villeurbanne69621 France

ISBN: (纸本)9783030584740

constraint programming models have been recently proposed to solve cryptanalysis problems for symmetric block ciphers such as AES. these models are more efficient than dedicated approaches but their design is difficult: straightforward models do not scale well and it is necessary to add advanced constraints derived from cryptographic properties. We introduce a global constraint which simplifies the modelling step and improves efficiency. We study its complexity, introduce propagators and experimentally evaluate them on two cryptanalysis problems (single-key and related-key) for two block ciphers (AES and Midori). © 2020, Springer Nature Switzerland AG.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint 7

引用

7th international conference on principles and practice of constraint programming, cp 2001

作者： Beldiceanu, Nicolas Carlsson, Mats SICS Lägerhyddsv. 18 UppsalaSE-752 37 Sweden

ISBN: (纸本)3540428631

We first present a generic pruning technique which aggregates several constraints sharing some variables. the method is derived from an idea called sweep which is extensively used in computational geometry. A first benefit of this technique comes from the fact that it can be applied to several families of global constraints. A second advantage is that it does not lead to any memory consumption problem since it only requires temporary memory which can be reclaimed after each invocation of the method. We then specialize this technique to the non-overlapping rectangles constraint, describe several optimizations, and give an empirical evaluation based on six sets of test instances with different characteristics. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

A new multi-resource cumulatives constraint with negative heights 8th

引用

8th international conference on principles and practice of constraint programming, cp 2002

作者： Beldiceanu, Nicolas Carlsson, Mats SICS Lagerhyddsvagen 18 UppsalaSE-75237 Sweden

ISBN: (纸本)3540441204

this paper presents a new cumulatives constraint, which generalizes the original cumulative constraint in different ways. the two most important aspects consist in permitting multiple cumulative resources as well as negative heights for the resource consumption of the tasks. this allows modeling in an easy way workload covering, producer-consumer, and scheduling problems. the introduction of negative heights has forced us to come up with new filtering algorithms and to revisit existing ones. the first filtering algorithm is derived from an idea called sweep, which is extensively used in computational geometry;the second algorithm is based on a combination of sweep and constructive disjunction;while the last is a generalization of task intervals to this new context. A real-life crew scheduling problem originally motivated this constraint which was implemented within the SICStus finite domain solver and evaluated against different problem patterns. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：