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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

956 篇 会议
51 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

853 篇 工学
- 833 篇 计算机科学与技术...
- 495 篇 软件工程
- 41 篇 信息与通信工程
- 27 篇 电气工程
- 17 篇 控制科学与工程
- 8 篇 机械工程
- 7 篇 土木工程
- 6 篇 建筑学
- 6 篇 化学工程与技术
- 5 篇 材料科学与工程（可...
- 5 篇 农业工程
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 4 篇 生物工程
- 3 篇 冶金工程
- 3 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 航空宇航科学与技...
530 篇 理学
- 422 篇 数学
- 274 篇 系统科学
- 18 篇 统计学（可授理学、...
- 10 篇 物理学
- 7 篇 生物学
- 6 篇 化学
62 篇 管理学
- 54 篇 管理科学与工程(可...
- 34 篇 工商管理
- 10 篇 图书情报与档案管...
7 篇 法学
- 7 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 农学
- 5 篇 作物学
1 篇 教育学
1 篇 医学
1 篇 军事学

主题

198 篇 constraint theor...
163 篇 constraint satis...
62 篇 constraint progr...
26 篇 constrained opti...
25 篇 computer program...
23 篇 integer programm...
21 篇 answer set progr...
15 篇 logic programmin...
15 篇 scheduling
14 篇 dynamic programm...
13 篇 problem solving
12 篇 linear programmi...
11 篇 global constrain...
10 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...
7 篇 model checking
7 篇 semantics
7 篇 local search
6 篇 optimization

机构

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

作者

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

语言

1,009 篇 英文
3 篇 中文

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

共 1012 条记录，以下是281-290 订阅

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

详细简洁

排序：

Tree-Decompositions with Connected Clusters for Solving constraint Networks

Tree-Decompositions with Connected Clusters for Solving Cons...

引用

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

作者： Jegou, Philippe Terrioux, Cyril Aix Marseille Univ LSIS UMR 7296 F-13397 Marseille France

ISBN: (纸本)9783319104287;9783319104270

From a theoretical viewpoint, the (tree-) decomposition methods offer a good approach for solving constraint Satisfaction Problems (CSPs) when their (tree)-width is small. In this case, they have often shown their practical interest. So, the literature (coming from Mathematics or AI) has concentrated its efforts on the minimization of a single parameter, the tree-width. Nevertheless, experimental studies have shown that this parameter is not always the most relevant to consider for solving CSPs. In this paper, we experimentally show that the decomposition algorithms of the state of the art produce clusters (a tree-decomposition is a tree of clusters) having several connected components. then we highlight that such clusters create a real problem for the efficiency of solving methods. To avoid this kind of problem, we consider here a new kind of graph decomposition called Bag-Connected Tree-Decomposition, which considers only tree-decompositions such that each cluster is connected. We propose a first polynomial time algorithm to find such decompositions. Finally, we show experimentally that using these bag-connected tree-decompositions improves significantly the solving of CSPs by decomposition methods.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

the Non-overlapping constraint between Objects Described by Non-linear Inequalities

The Non-overlapping Constraint between Objects Described by ...

引用

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

作者： Salas, Ignacio Chabert, Gilles Goldsztejn, Alexandre Mines Nantes LINA UMR 6241 Nantes France CNRS LINA UMR 6241 F-75700 Paris France

ISBN: (纸本)9783319104287;9783319104270

Packing 2D objects in a limited space is an ubiquitous problem with many academic and industrial variants. In any case, solving this problem requires the ability to determine where a first object can be placed so that it does not intersect a second, previously placed, object. this subproblem is called the non-overlapping constraint. the complexity of this non-overlapping constraint depends on the type of objects considered. It is simple in the case of rectangles. It has also been studied in the case of polygons. this paper proposes a numerical approach for the wide class of objects described by non-linear inequalities. Our goal here is to calculate the non-overlapping constraint, that is, to describe the set of all positions and orientations that can be assigned to the first object so that intersection with the second one is empty. this is done using a dedicated branch & prune approach. We first show that the non-overlapping constraint can be cast into a Minkowski sum, even if we take into account orientation. We derive from this an inner contractor, that is, an operator that removes from the current domain a subset of positions and orientations that necessarily violate the non-overlapping constraint. this inner contractor is then embedded in a sweeping loop, a pruning technique that was only used with discrete domains so far. We finally come up with a branch & prune algorithm that outperforms Rsolver, a generic state-of-the-art solver for continuous quantified constraints.

关键词： Contractors

来源：评论

学校读者我要写书评

暂无评论

Worst-Case Scheduling of Software Tasks A constraint Optimization Model to Support Performance Testing

Worst-Case Scheduling of Software Tasks A Constraint Optimiz...

引用

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

作者： Di Alesio, Stefano Nejati, Shiva Briand, Lionel Gotlieb, Arnaud Simula Res Lab Certus Ctr Software Verificat & Validat Oslo Norway Univ Luxembourg Interdisciplinary Ctr Reliabil Secur & Trust SnT Luxembourg Luxembourg

ISBN: (纸本)9783319104287;9783319104270

Real-Time Embedded Systems (RTES) in safety-critical domains, such as maritime and energy, must satisfy strict performance requirements to be deemed safe. therefore, such systems have to be thoroughly tested to ensure their correct behavior even under the worst operating conditions. In this paper, we address the need of deriving worst case scenarios with respect to three common performance requirements, namely task deadlines, response time, and CPU usage. Specifically, we investigate whether this worst-case analysis can be effectively re-expressed as a Constrained Optimization Problem (COP) over the space of possible inputs to the system. Solving this problem means finding the sets of inputs that maximize the chance to violate performance requirements at runtime. Such inputs can in turn be used to test if the target RTES meets the expected performance even in the worst case. We develop an OPL model for IBM ILOG CP OPTIMIZER that implements a task priority-based preemptive scheduling, and apply it to a case study from the maritime and energy domain. Our validation shows that (1) the input to our model can be provided with reasonable effort in an industrial setting, and (2) the COP effectively identifies test cases that maximize deadline misses, response time, and CPU usage.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Discriminating Instance Generation for Automated constraint Model Selection

Discriminating Instance Generation for Automated Constraint ...

引用

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

作者： Gent, Ian P. Hussain, Bilal Syed Jefferson, Christopher Kotthoff, Lars Miguel, Ian Nightingale, Glenna F. Nightingale, Peter Univ St Andrews Sch Comp Sci St Andrews KY16 9AJ Fife Scotland INSIGHT Ctr Data Analyt Dublin Ireland

ISBN: (纸本)9783319104287;9783319104270

One approach to automated constraint modelling is to generate, and then select from, a set of candidate models. this method is used by the automated modelling system CONJURE. To select a preferred model or set of models for a problem class from the candidates CONJURE produces, we use a set of training instances drawn from the target class. It is important that the training instances are discriminating. If all models solve a given instance in a trivial amount of time, or if no models solve it in the time available, then the instance is not useful for model selection. this paper addresses the task of generating small sets of discriminating training instances automatically. the instance space is determined by the parameters of the associated problem class. We develop a number of methods of finding parameter configurations that give discriminating training instances, some of them leveraging existing parameter-tuning techniques. Our experimental results confirm the success of our approach in reducing a large set of input models to a small set that we can expect to perform well for the given problem class.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Computing a Payoff Division in the Least Core for MC-nets Coalitional Games 1

引用

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

作者： Hirayama, Katsutoshi Hanada, Kenta Ueda, Suguru Yokoo, Makoto Iwasaki, Atsushi Kobe Univ Kobe Hyogo Japan Natl Inst Informat Kumamoto Japan Kyushu Univ Fukuoka Japan Univ Elect Commnunicat Tokyo Japan

ISBN: (数字)9783319131917

ISBN: (纸本)9783319131917;9783319131900

MC-nets is a concise representation of the characteristic functions that exploits a set of rules to compute payoffs. Given a MC-nets instance, the problem of computing a payoff division in the least core, which is a generalization of the core-non-emptiness problem that is known to be coNP-complete, is definitely a hard computational problem. In fact, to the best of our knowledge, no algorithm can actually compute such a payoff division for MC-nets instances with dozens of agents. We propose a new algorithm for this problem, that exploits the constraint generation technique to solve the linear programming problem that potentially has a huge number of constraints. Our experimental results are striking since, using 8 GB memory, our proposed algorithm can successfully compute a payoff division in the least core for the instances with up to 100 agents, but the naive algorithm fails due to a lack of memory for instances with 30 or more agents.

关键词： coalitional games least core MC-nets constraint generation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

the balance constraint family

The balance constraint family

引用

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

作者： Bessiere, Christian Hebrard, Emmanuel Katsirelos, George Kiziltan, Zeynep Picard-Cantin, Émilie Quimper, Claude-Guy Walsh, Toby CNRS University of Montpellier France LAAS-CNRS Toulouse France INRA Toulouse France DISI University of Bologna Italy Université Laval Canada NICTA University of New South Wales Australia

ISBN: (纸本)9783319104270

the Balance constraint introduced by Beldiceanu ensures solutions are balanced. this is useful when, for example, there is a requirement for solutions to be fair. Balance bounds the difference B between the minimum and maximum number of occurrences of the values assigned to the variables. We show that achieving domain consistency on Balance is NP-hard. We therefore introduce a variant, AllBalance with a similar semantics that is only polynomial to propagate. We consider various forms of AllBalance and focus on AtMostallBalance which achieves what is usually the main goal, namely constraining the upper bound on B. We provide a specialized propagation algorithm, and a powerful decomposition both of which run in low polynomial time. Experimental results demonstrate the promise of these new filtering methods. © 2014 Springer international Publishing Switzerland.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Automatically improving constraint models in savile row through associative-commutative common subexpression elimination

Automatically improving constraint models in savile row thro...

引用

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

作者： Nightingale, Peter Akgün, Özgür Gent, Ian P. Jefferson, Christopher Miguel, Ian School of Computer Science University of St. Andrews St.-Andrews Fife-KY16 9SX United Kingdom

ISBN: (纸本)9783319104270

When solving a problem using constraint programming, constraint modelling is widely acknowledged as an important and difficult task. Even a constraint modelling expert may explore many models and spend considerable time modelling a single problem. therefore any automated assistance in the area of constraint modelling is valuable. Common sub-expression elimination (CSE) is a type of constraint reformulation that has proved to be useful on a range of problems. In this paper we demonstrate the value of an extension of CSE called Associative-Commutative CSE (AC-CSE). this technique exploits the properties of associativity and commutativity of binary operators, for example in sum constraints. We present a new algorithm, X-CSE, that is able to choose from a larger palette of common subexpressions than previous approaches. We demonstrate substantial gains in performance using X-CSE. For example on BIBD we observed speed increases of more than 20 times compared to a standard model and that using X-CSE outperforms a sophisticated model from the literature. For Killer Sudoku we found that X-CSE can render some apparently difficult instances almost trivial to solve, and we observe speed increases up to 350 times. For BIBD and Killer Sudoku the common subexpressions are not present in the initial model: an important part of our methodology is reformulations at the preprocessing stage, to create the common subexpressions for X-CSE to exploit. In summary we show that X-CSE, combined with preprocessing and other reformulations, is a powerful technique for automated modelling of problems containing associative and commutative constraints. © 2014 Springer international Publishing Switzerland.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming - 18th international conference, CP 2012, Proceedings

Principles and Practice of Constraint Programming - 18th Int...

引用

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

ISBN: (纸本)9783642335570

the proceedings contain 71 papers. the topics discussed include: constraint programming and a usability quest;optimization challenges in smart grid operations;where are the interesting problems?;a generic method for identifying and exploiting dominance relations;scheduling scientific experiments on the Rosetta/Philae mission;an optimal arc consistency algorithm for a chain of atmost constraints with cardinality;conflict directed lazy decomposition;boosting local consistency algorithms over floating-point numbers;a model seeker: extracting global constraint models from positive examples;on computing minimal equivalent subformulas;Weibull-based benchmarks for bin packing;space-time tradeoffs for the regular constraint;inter-instance nogood learning in constraint programming;a characterization of the complexity of forbidding subproblems in binary max-CSP;and optimization modeling for software developers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient pseudorecursive evaluation schemes for non-adaptive sparse grids 1

引用

2nd Workshop on Sparse Grids and Applications, SGA 2012

作者： Buse, Gerrit Pflüger, Dirk Jacob, Riko TU München München Germany Institute for Parallel and Distributed Systems Universität Stuttgart Stuttgart Germany ETH Zurich Zurich Switzerland

ISBN: (数字)9783319045375

ISBN: (纸本)9783319045368

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma thesis, Institut für Numerische Simulation, Universität Bonn, 2005) and Murarasu et al. (Proceedings of the 16th ACM Symposium on principles and practice of Parallel programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (Proceedings of the international conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation. © Springer international Publishing Switzerland 2014.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：