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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

167 篇 会议
12 篇 期刊文献
5 册 图书

馆藏范围

183 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

151 篇 工学
- 145 篇 计算机科学与技术...
- 78 篇 软件工程
- 8 篇 信息与通信工程
- 6 篇 电气工程
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 1 篇 材料科学与工程（可...
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 化学工程与技术
56 篇 理学
- 45 篇 数学
- 37 篇 系统科学
- 1 篇 化学
- 1 篇 统计学（可授理学、...
4 篇 管理学
- 4 篇 管理科学与工程(可...
- 1 篇 工商管理
2 篇 农学
- 2 篇 作物学
1 篇 军事学

主题

37 篇 constraint satis...
31 篇 constraint theor...
12 篇 constraint progr...
6 篇 local search
5 篇 global constrain...
5 篇 constraint
4 篇 software enginee...
4 篇 incremental
4 篇 symmetry
4 篇 mathematical log...
4 篇 artificial intel...
3 篇 modeling
3 篇 problem solving
3 篇 integer programm...
3 篇 programming tech...
3 篇 programming lang...
3 篇 logics and meani...
2 篇 constraint proce...
2 篇 solution countin...
2 篇 meta-heuristic

机构

8 篇 brown univ provi...
6 篇 natl univ irelan...
6 篇 cork constraint ...
4 篇 univ st andrews ...
4 篇 univ st andrews ...
4 篇 univ connecticut...
3 篇 ilog 9 avenue de...
3 篇 max planck inst ...
3 篇 univ oxford comp...
3 篇 univ waterloo sc...
2 篇 univ st andrews ...
2 篇 univ nice sophia...
2 篇 univ pompeu fabr...
2 篇 univ potsdam pot...
2 篇 aalto univ aalto
2 篇 inria rennes ren...
2 篇 ensieta f-29806 ...
2 篇 univ coll cork c...
2 篇 univ st andrews ...
2 篇 natl univ singap...

作者

10 篇 gent ian p.
9 篇 miguel ian
9 篇 nightingale pete...
7 篇 smith barbara m.
6 篇 jefferson christ...
6 篇 o’sullivan barry
6 篇 freuder eugene c...
5 篇 van hentenryck p
5 篇 jeavons peter
5 篇 puget jean-franç...
4 篇 stuckey peter j.
4 篇 michel l
4 篇 kelsey tom
4 篇 kotthoff lars
4 篇 cohen david a.
3 篇 van hentenryck p...
3 篇 schaub torsten
3 篇 rueher michel
3 篇 jefferson chris
3 篇 katriel i

语言

183 篇 英文
1 篇 中文

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

共 184 条记录，以下是81-90 订阅

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

详细简洁

排序：

Sweeping with Continuous Domains

Sweeping with Continuous Domains

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Chabert, Gilles Beldiceanu, Nicolas Ecole Mines Nantes CNRS LINA UMR 6241 F-44300 Nantes France

ISBN: (纸本)9783642153952

the geost constraint has been proposed to model and solve discrete placement problems involving multi-dimensional boxes (packing in space and time). the filtering technique is based on a sweeping algorithm that requires the ability for each constraint to compute a forbidden box around a given fixed point and within a. surrounding area.. Several cases have been studied so far, including integer linear inequalities. Motivated by the placement of objects with curved shapes, this paper shows how to implement this service for continuous constraints with arbitrary mathematical expressions. the approach relies on symbolic processing and defines a new interval arithmetic.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Testing Expressibility Is Hard

Testing Expressibility Is Hard

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Willard, Ross Univ Waterloo Dept Pure Math Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783642153952

We study the expressibility problem: given a finite constraint language F on a finite domain and another relation R, can F express R? We prove, by an explicit family of examples;that the standard witnesses to expressibility and inexpressibility (gadgets/formulas/conjunctive queries and polymorphisms respectively) may be required to be exponentially larger than the instances. We also show that the full expressibility problem is co-NEXPTIME-hard. Our proofs hinge on a novel interpretation of a tiling problem into the expressibility problem.

关键词： constraint relation expressive power inverse satisfiability structure identification conjunctive query primitive positive formula polymorphism domino system nondeterministic exponential time

来源：评论

学校读者我要写书评

暂无评论

Clingo goes linear constraints over reals and integers

Clingo goes linear constraints over reals and integers

引用

33rd international conference on Logic programming colocated with the 23rd international conference on principles and practice of constraint programming / 20th international conference on theory and Applications of Satisfiability Testing

作者： Janhunen, Tomi Kaminski, Roland Ostrowski, Max Schellhorn, Sebastian Wanko, Philipp Schaub, Torsten Aalto Univ Aalto Finland Univ Potsdam Potsdam Germany INRIA Rennes Rennes France

the recent series 5 of the Answer Set programming (ASP) system clingo provides generic means to enhance basic ASP with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common language fragments and contrast them to related ASP systems.

关键词： constraint Answer Set programming (CASP) Answer Set programming (ASP) constraint Processing (cp) theory Solving

来源：评论

学校读者我要写书评

暂无评论

A Complete Tolerant Algebraic Side-Channel Attack for AES with cp 1

引用

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

作者： Liu, Fanghui Cruz, Waldemar Michel, Laurent Univ Connecticut Sch Engn Comp Sci & Engn Dept Storrs CT 06269 USA

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

Tolerant Algebraic Side-Channel Attack (TASCA) is a combination of algebraic and side-channel analysis with error tolerance. Oren et al., used mathematical programming to implement TASCA over a round-limited version of AES. In [7], Liu et al. revisited their results and introduced a TASCA-cp model that delivers solutions to this 1-round relaxation with orders of magnitude improvement in both solving time and memory consumption. this paper extends the result and considers TASCA for the full 10-rounds AES algorithm. Two approaches are introduced: staged and integrated. the staged approach uses TASCA-cp as a spring board to enumerate and check its candidate solutions against the requirements of subsequent rounds. the integrated model formulates all the rounds of AES together with side-channel constraints on all rounds within a single unified optimization model. Empirical results shows both approaches are suitable to find the correct key of AES while the integrated model dominates the staged both in simplicity and solving time.

关键词： Algebraic side-channel attack AES Cryptography Block cipher constraint programming Optimization

来源：评论

学校读者我要写书评

暂无评论

Exponential Propagation for Set Variables

Exponential Propagation for Set Variables

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Yip, Justin Van Hentenryck, Pascal Brown Univ Providence RI 02912 USA

ISBN: (纸本)9783642153952

Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of constraint programming over sets have been diametrically different. the domain representations are becoming increasingly expensive computationally and theoretical results appear to question the wisdom of these research directions. this paper explores this apparent contradiction by pursuing even more complexity in the domain representation and the filtering algorithms. It shows that;the product of the length-lex and subset-bound domains improves filtering and produces orders of magnitude improvements over existing approaches on standard benchmarks. Moreover, the paper proposes exponential-time algorithms for NP-hard intersection constraints and demonstrates that they bring significant performance improvements and speeds up constraint propagation considerably.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Computing explanations for global scheduling constraints

引用

9th international conference on principles and practice of constraint programming, cp 2003

作者： Vilím, Petr Charles University Malostranské náměstí 2/25 Praha 1 Czech Republic

ISBN: (纸本)3540202021

Integration of explanations into a CSP solver is a technique addressing difficult question "why my problem has no solution". Besides providing some sort of answer to the user, explanations can be used for debugging, solving dynamic problems and in advanced search algorithms. Explanations work pretty well with simple constraints. However, in order to use explanations together with a global constraint, its filtering algorithm (i.e. propagation) has to be enhanced to be explanation-aware. In my work I focus on such a technique for classical scheduling filtering algorithms like edge-finding and not-first/not-last. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Global constraints on Feature Models

Global Constraints on Feature Models

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Karatas, Ahmet Serkan Oguztuzun, Halit Dogru, Ali Middle E Tech Univ Dept Comp Engn TR-06531 Ankara Turkey

ISBN: (纸本)9783642153952

Feature modeling has been found very effective for modeling and managing variability in Software Product Lines. the nature of feature models invites, sometimes even requires, the use of global constraints. this paper lays the groundwork for the inclusion of global constraints in automated reasoning on feature models. We present a mapping from extended feature models to constraint logic programming over finite domains, and show that this mapping enables using global constraints on feature attributes, as well as features, for a variety of analysis operations on feature models. We also present performance test results and discuss the benefits of using global constraints.

关键词： constraint logic programming over finite domains feature models Global constraints

来源：评论

学校读者我要写书评

暂无评论

Local Consistency and SAT-Solvers

Local Consistency and SAT-Solvers

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Petke, Justyna Jeavons, Peter Univ Oxford Comp Lab Oxford OX1 3QD England

ISBN: (纸本)9783642153952

In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hyper-resolution, on the direct Boolean encoding of the CSP instance. We also show that current clause-learning SAT-solvers will deduce any positive-hyper-resolvent of a fixed size from a given set of clauses in polynomial expected time. We combine these two results to show that, without being explicitly designed to do so, current clause-learning SAT-solvers efficiently simulate k-consistency techniques, for all values of k. We then give some experimental results to show that this feature allows clause-learning SAT-solvers to efficiently solve certain families of CSP instances which are challenging for conventional cp solvers.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Soft arc consistency applied to optimal planning

Soft arc consistency applied to optimal planning

引用

12th international conference on principles and practice of constraint programming (cp 2006)

作者： Cooper, Martin Cussat-Blanc, Sylvain de Roquemaurel, Marie Regnier, Pierre Univ Toulouse 3 IRIT F-31062 Toulouse 9 France

ISBN: (纸本)3540462678

We show in this article(1) how the Weighted CSP framework can be used to solve an optimisation version of numerical planning. the WCSP finds an optimal plan in the planning graph containing all solution plans of minimum length. Experimental trials were performed to study the impact of soft arc consistency techniques (FDAC and EDAC) on the efficiency of the search for an optimal plan in this graph. We conclude by giving a possible theoretical explanation for the fact that we were able to solve optimisation problems involving several hundred variables.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining 1

引用

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

作者： Dlala, Imen Ouled Jabbour, Said Raddaoui, Badran Sais, Lakhdar Univ Artois CNRS CRIL F-62307 Lens France Univ Paris Saclay CNRS SAMOVAR Telecom SudParis Evry France Univ Tunis LARODEC Tunis Tunisia

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

constraint programming (cp) and propositional satisfiability (SAT) based framework for modeling and solving pattern mining tasks has gained a considerable audience in recent years. However, this nice declarative and generic framework encounters a scaling problem. the huge size of constraints networks/propositional formulas encoding large datasets is identified as the main bottleneck of most existing approaches. In this paper, we propose a parallel SAT based framework for itemset mining problem to push forward the solving efficiency. the proposed approach is based on a divide-and-conquer paradigm, where the transaction database is partitioned using item-based guiding paths. Such decomposition allows us to derive smaller and independent Boolean formulas that can be solved in parallel. the performance and scalability of the proposed algorithm are evaluated through extensive experiments on several datasets. We demonstrate that our partition-based parallel SAT approach outperforms other cp approaches even in the sequential case, while significantly reducing the performances gap with specialized approaches.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：