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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Closing the Open Shop: Contradicting Conventional Wisdom

Closing the Open Shop: Contradicting Conventional Wisdom

引用

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

作者： Grimes, Diarmuid Hebrard, Emmanuel Malapert, Arnaud Cork Constraint Computat Ctr Cork Ireland Cirrelt CNRS EMN LINA UMR 6241 Montreal PQ Canada

ISBN: (纸本)9783642042430

this paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused oil developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such domain specific models. We introduce a simple constraint model that combines a generic adaptive heuristic with naive propagation, and show that it often outperforms state-of-the-art solvers for both open shop and job shop problems.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Insights into Parallelism with Intensive Knowledge Sharing

Insights into Parallelism with Intensive Knowledge Sharing

引用

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

作者： Sabharwal, Ashish Samulowitz, Horst Allen Inst Artificial Intelligence AI2 Seattle WA 98103 USA IBM Watson Res Ctr Yorktown Hts NY 10598 USA

ISBN: (纸本)9783319104287;9783319104270

Novel search space splitting techniques have recently been successfully exploited to paralleliz constraint programming and Mixed Integer programming solvers. We first show how universal hashing can be used to extend one such interesting approach to a generalized setting that goes beyond discrepancy-based search, while still retaining strong theoretical guarantees. We then explain that such static or explicit splitting approaches are not as effective in the context of parallel combinatorial search with intensive knowledge acquisition and sharing such as parallel SAT, where implicit splitting through clause sharing appears to dominate. Furthermore, we show that in a parallel setting there exists a surprising tradeoff between the well-known communication cost for knowledge sharing across multiple compute nodes and the so far neglected cost incurred by the computational load per node. We provide experimental evidence that one can successfully exploit this tradeoff and achieve reasonable speedups in parallel SAT solving beyond 16 cores.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Solution directed backjumping for QCSP

Solution directed backjumping for QCSP

引用

13th international conference on principles and practice of constraint programming (cp 2007)

作者： Bacchus, Fahiem Stergiou, Kostas Univ Toronto Dept Comp Sci Toronto ON Canada Univ Aegean Dept Informat & Commun Syst Engn Mitilini Greece

ISBN: (纸本)9783540749691

In this paper we present new techniques for improving backtracking based Quantified constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variables are either universally or existentially quantified and these quantifiers can be alternated in arbitrary ways. Our main new technique is solution directed backjumping (SBJ). In analogue to conflict directed backjumping, SBJ allows the solver to backtrack out of solved sub-trees without having to find all of the distinct solutions normally required to validate the universal variables. Experiments with the solver QCSP-Solve demonstrate that SBJ can improve its performance on random instances by orders of magnitude. In addition to this contribution, we demonstrate that performing varying levels of propagation for universal vs. existential variables can also be useful for enhancing performance. Finally, we discuss some techniques that are technically interesting but do not yet yield empirical improvements.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

GAC via unit propagation

GAC via unit propagation

引用

13th international conference on principles and practice of constraint programming (cp 2007)

作者： Bacchus, Fahiem Univ Toronto Dept Comp Sci Toronto ON Canada

ISBN: (纸本)9783540749691

In this paper we argue that an attractive and potentially very general way of achieving generalized are consistency (GAC) on a constraint is by using unit propagation (UP) over a CNF encoding of the constraint. this approach to GAC offers a number of advantages over traditional constraint specific algorithms (propagators): it is easier to implement, it automatically provides incrementality and decrementality in a backtracking context, and it can provide clausal reasons to support learning and non-chronological backtracking. Although UP on standard CNF encodings of a constraint fails to achieve GAC, we show here that alternate CNF encodings can be used on which UP does achieve GAC. We provide a generic encoding applicable to any constraint. We also give structure specific encodings for the regular, among, and gen-sequence constraints on which UP can achieve GAC with the same run time bounds as previously presented propagators. Finally, we explain how a UP engine can be added to a CSP solver to achieve a seamless integration of constraints encoded in CNF and propagated via UP and those propagated via traditional constraint specific propagators.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Towards stochastic constraint programming: A study of onine multi-choice knapsack with deadlines

引用

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

作者： Benoist, thierry Bourreau, Eric Caseau, Yves Rottembourg, Benoît Bouygues e-lab 1 av. Eugène Freyssinet St Quentin en Yvelines Cedex78061 France

ISBN: (纸本)3540428631

constraint programming (cp) is a very general programming paradigm that proved its efficiency on solving complex industrial problems. Most real-life problems are stochastic in nature, which is usually taken into account through different compromises, such as applying a deterministic algorithm to the average values of the input, or performing multiple runs of simulation. Our goal in this paper is to analyze different techniques taken either from practical cp applications or from stochastic optimization approaches. We propose a benchmark issued from our industrial experience, which may be described as an Online Multi-choice Knapsack with Deadlines. this benchmark is used to test a framework with four different dynamic strategies that utilize a different combination of the stochastic and combinatorial aspects of the problem. To evaluate the expected future state of the reservations at the time horizon, we either use simulation, average values, systematic study of the most probable scenarios, or yield management techniques. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

A general scheme for multiple lower bound computation in constraint optimization 7

引用

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

作者： Dechter, Rina Kask, Kalev Larrosa, Javier United States Spain

ISBN: (纸本)3540428631

Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of lower bounds to all singleton tuples, since it permits domain pruning in Branch and Bound algorithms. In this paper we introduce MCTE(z), a general algorithm which allows the computation of lower bounds to arbitrary sets of tasks. Its time and accuracy grows as a function of z allowing a controlled trade off between lower bound accuracy and time and space to fit available resources. Subsequently, a specialization of MCTE(z) called MBTE(z) is tailored to computing lower bounds to singleton tuples. Preliminary experiments on Max-CSP show that using MBTE(z) to guide dynamic variable and value orderings in branch and bound yields a dramatic reduction in the search space and, for some classes of problems, this reduction is highly cost-effective producing significant time savings and is competitive against specialized algorithms for Max-CSP. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

View-Based Propagator Derivation

View-Based Propagator Derivation

引用

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

作者： Schulte, Christian Tack, Guido KTH Royal Inst Technol SCALE Stockholm Sweden Monash Univ NICTA Melbourne Vic Australia

ISBN: (纸本)9783319104287;9783319104270

When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? constraint variants are ubiquitous: implementing them requires considerable effort, but yields better performance. this abstract shows how to use views to derive propagator variants where derived propagators are perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators are developed, and the abstract sketches an implementation architecture for views that is independent of the underlying constraint programming system. Evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

New lower bounds of constraint violations for over-constrained problems 7

引用

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

作者： Règin, Jean-Charles Petit, thierry Bessière, Christian Puget, Jean-François ILOG 1681 route des Dolines Valbonne06560 France LIRMM UMR 5506 CNRS 161 rue Ada Montpellier Cedex 534392 France ILOG 9 rue de Verdun BP 85 Gentilly Cedex94253 France

ISBN: (纸本)3540428631

In recent years, many works have been carried out to solve over-constrained problems, and more specifically the Maximal constraint Satisfaction Problem (Max-CSP), where the goal is to minimize the number of constraint violations. Some lower bounds on this number of violations have been proposed in the literature. In this paper, we characterize the constraints that are ignored by the existing results, we propose new lower bounds which takes into account some of these ignored constraints and we show how these new bounds can be integrated into existing ones in order to improve the previous results. Our work also generalize the previous studies by dealing with any kind of constraints, as non binary constraints, or constraints with specific filtering algorithms. Furthermore, in order to integrate these algorithms into any constraint solver, we suggest to represent a Max-CSP as a single global constraint. this constraint can be itself included into any set of constraint. In this way, an over-constrained part of a problem can be isolated from constraints that must be necessarily satisfied. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Deployment of Mobile Wireless Sensor Networks for Crisis Management: A constraint-Based Local Search Approach

Deployment of Mobile Wireless Sensor Networks for Crisis Man...

引用

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

作者： Pralet, Cedric Lesire, Charles Off Natl Etud & Rech Aerosp French Aerosp Lab F-31055 Toulouse France

ISBN: (纸本)9783319104287;9783319104270

In this paper, we consider a problem of management of crisis situations (incidents on nuclear or chemical plants, natural disasters...) that require remote sensing, using a set of ground and aerial robots. In this problem, sensed data must be transmitted in real-time to an operation center even in case of unavailability of traditional communication infrastructures. this implies that an ad hoc wireless communication network must be deployed, for instance using a fleet of UAVs acting as communication relays. From a technical point of view, we tackle a scheduling problem in which activities of mobile sensing robots and mobile relays must be synchronized both in time and space. Schedules produced must also be flexible and robust to the uncertainty about the duration of robot moves at execution time. the problem is modeled and solved using constraint-based local search, with some calls to graph algorithms that help defining good communication networks.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：