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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A scalable sweep algorithm for the cumulative constraint

A scalable sweep algorithm for the cumulative constraint

引用

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

作者： Letort, Arnaud Beldiceanu, Nicolas Carlsson, Mats Mines de Nantes France SICS P.O. Box 1263 SE-164 29 Kista Sweden

ISBN: (纸本)9783642335570

this paper presents a sweep based algorithm for the cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks, this algorithm has a worst-case time complexity of O(n 2). In practice, we use a variant with better average-case complexity but worst-case complexity of O(n 2 logn), which goes down to O(n logn) when all tasks have unit duration, i.e. in the bin-packing case. Despite its worst-case time complexity, this algorithm scales well in practice, even when a significant number of tasks can be scheduled in parallel. It handles up to 1 million tasks in one single cumulative constraint in both Choco and SICStus. © 2012 Springer-Verlag.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A complete solver for constraint games

A complete solver for constraint games

引用

20th international conference on the principles and practice of constraint programming, cp 2014

作者： Nguyen, thi-Van-Anh Lallouet, Arnaud GREYC Université de Caen Campus Côte de Nacre Boulevard du Maréchal Juin BP 5186 14032 Caen Cedex France

ISBN: (纸本)9783319104270

Game theory studies situations in which multiple agents having conflicting objectives have to reach a collective decision. the question of a compact representation language for agents utility function is of crucial importance since the classical representation of a n-players game is given by a n-dimensional matrix of exponential size for each player. In this paper we use the framework of constraint Games in which CSP are used to represent utilities. constraint programming -including global constraints- allows to easily give a compact and elegant model to many useful games. constraint Games come in two flavors: constraint Satisfaction Games and constraint Optimization Games, the first one using satisfaction to define boolean utilities. In addition to multimatrix games, it is also possible to model more complex games where hard constraints forbid certain situations. In this paper we study complete search techniques and show that our solver using the compact representation of constraint Games is faster than the classical game solver Gambit by one to two orders of magnitude. © 2014 Springer international Publishing Switzerland.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Focus : A constraint for concentrating high costs

Focus : A constraint for concentrating high costs

引用

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

作者： Petit, thierry 4 Rue Alfred Kastler Nantes Cedex 3 FR-44307 France

ISBN: (纸本)9783642335570

Many constraint programming models use integer cost variables aggregated in an objective criterion. In this context, some constraints involving exclusively cost variables are often imposed. Such constraints are complementary to the objective function. they characterize the solutions which are acceptable in practice. this paper deals with the case where the set of costs is a sequence, in which high values should be concentrated in a few number of areas. Representing such a property through a search heuristic may be complex and overall not precise enough. To solve this issue, we introduce a new constraint, Focus(X, y c ,len, k), where X is a sequence of n integer variables, y c an integer variable, and len and k are two integers. To satisfy Focus, the minimum number of distinct sub-sequences of consecutive variables in X, of length at most len and that involve exclusively values strictly greater than k, should be less than or equal to y c . We present two examples of problems involving Focus. We propose a complete filtering algorithm in O(n) time complexity. © 2012 Springer-Verlag.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Feature term subsumption using constraint programming with basic variable symmetry

Feature term subsumption using constraint programming with b...

引用

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

作者： Ontañón, Santiago Meseguer, Pedro Computer Science Department Drexel University Philadelphia PA 19104 United States IIIA-CSIC Universitat Autònoma de Barcelona Bellaterra 08193 Spain

ISBN: (纸本)9783642335570

Feature Terms are a generalization of first-order terms which have been recently received increased attention for their usefulness in structured machine learning applications. One of the main obstacles for their wide usage is that their basic operation, subsumption, has a very high computational cost. constraint programming is a very suitable technique to implement that operation, in some cases providing orders of magnitude speed-ups with respect to the standard subsumption approach. In addition, exploiting a basic variable symmetry -that often appears in Feature Terms databases- causes substantial additional savings. We provide experimental results of the benefits of this approach. © 2012 Springer-Verlag.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

constraint satisfaction over bit-vectors

Constraint satisfaction over bit-vectors

引用

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

作者： Michel, Laurent D. Van Hentenryck, Pascal University of Connecticut Storrs CT 06269-2155 United States Optimization Research Group NICTA University of Melbourne Australia

ISBN: (纸本)9783642335570

Reasoning over bit-vectors arises in a variety of applications in verification and cryptography. this paper presents a bit-vector domain for constraint programming and its associated filtering algorithms. the domain supports all the traditional bit operations and correctly models modulo-arithmetic and overflows. the domain implementation uses bit operations of the underlying architecture, avoiding the drawback of a bit-blasting approach that associates a variable with each bit. the filtering algorithms implement either domain consistency on the bit-vector domain or bit consistency, a new consistency notion introduced in this paper. Filtering algorithms for logical and structural constraints typically run in constant time, while arithmetic constraints such as addition run in time linear in the size of the bit-vectors. the paper also discusses how to channel bit-vector variables with an integer variable. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Challenges for constraint reasoning and optimization in computational sustainability

Challenges for constraint reasoning and optimization in comp...

引用

15th international conference on principles and practice of constraint programming, cp 2009

作者： Gomes, Carla P. Cornell University Ithaca NY United States

ISBN: (纸本)3642042430

Computational Sustainability is a new emerging research field with the overall goal of studying and providing solutions to computational problems for balancing environmental, economic, and societal needs for a sustainable future. I will provide examples of challenge problems in Computational Sustainability, ranging from wildlife preservation and biodiversity, to balancing socio-economic needs and the environment, to large-scale deployment and management of renewable energy sources, highlighting overarching computational themes in constraint reasoning and optimization and interactions with machine learning, and dynamical systems. I will also discuss the need for a new approach to study such challenging problems in which computational problems are viewed as "natural" phenomena, amenable to a scientific methodology in which principled experimentation, to explore problem parameter spaces and hidden problem structure, plays as prominent a role as formal analysis. © 2009 Springer Berlin Heidelberg.

关键词： Biodiversity

来源：评论

学校读者我要写书评

暂无评论

Refining abstract interpretation based value analysis with constraint programming techniques

Refining abstract interpretation based value analysis with c...

引用

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

作者： Ponsini, Olivier Michel, Claude Rueher, Michel University of Nice-Sophia Antipolis I3S/CNRS BP 121 Sophia Antipolis Cedex 06903 France

ISBN: (纸本)9783642335570

Abstract interpretation based value analysis is a classical approach for verifying programs with floating-point computations. However, state-of-the-art tools compute an over-approximation of the variable values that can be very coarse. In this paper, we show that constraint solvers can significantly refine the approximations computed with abstract interpretation tools. We introduce a hybrid approach that combines abstract interpretation and constraint programming techniques in a single static and automatic analysis. rAicp, the system we developed is substantially more precise than Fluctuat, a state-of-the-art static analyser. Moreover, it could eliminate 13 false alarms generated by Fluctuat on a standard set of benchmarks. © 2012 Springer-Verlag.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Solving minimal constraint networks in qualitative spatial and temporal reasoning

Solving minimal constraint networks in qualitative spatial a...

引用

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

作者： Liu, Weiming Li, Sanjiang Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney Australia

ISBN: (纸本)9783642335570

the minimal label problem (MLP) (also known as the deductive closure problem) is a fundamental problem in qualitative spatial and temporal reasoning (QSTR). Given a qualitative constraint network Γ, the minimal network of Γ relates each pair of variables (x,y) by the minimal label of (x,y), which is the minimal relation between x,y that is entailed by network Γ. It is well-known that MLP is equivalent to the corresponding consistency problem with respect to polynomial Turing-reductions. this paper further shows, for several qualitative calculi including Interval Algebra and RCC-8 algebra, that deciding the minimality of qualitative constraint networks and computing a solution of a minimal constraint network are both NP-hard problems. © 2012 Springer-Verlag.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

An optimal arc consistency algorithm for a chain of atmost constraints with cardinality

An optimal arc consistency algorithm for a chain of atmost c...

引用

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

作者： Siala, Mohamed Hebrard, Emmanuel Huguet, Marie-José CNRS LAAS 7 avenue du colonel Roche Toulouse F-31400 France Univ. de Toulouse INSA LAAS Toulouse F-31400 France Univ de Toulouse LAAS Toulouse F-31400 France

ISBN: (纸本)9783642335570

the AtMostSeqCard constraint is the conjunction of a cardinality constraint on a sequence of n variables and of n - q + 1 constraints AtMost u on each subsequence of size q. this constraint is useful in car-sequencing and crew-rostering problems. In [18], two algorithms designed for the AmongSeq constraint were adapted to this constraint with a O(2 q n) and O(n 3) worst case time complexity, respectively. In [10], another algorithm similarly adaptable to filter the AtMostSeqCard constraint with a time complexity of O(n 2) was proposed. In this paper, we introduce an algorithm for achieving Arc Consistency on the AtMostSeqCard constraint with a O(n) (hence optimal) worst case time complexity. We then empirically study the efficiency of our propagator on instances of the car-sequencing and crew-rostering problems. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：