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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

constraint-based register allocation and instruction scheduling

Constraint-based register allocation and instruction schedul...

引用

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

作者： Lozano, Roberto Castañeda Carlsson, Mats Drejhammar, Frej Schulte, Christian Sweden School of ICT KTH Royal Institute of Technology Sweden

ISBN: (纸本)9783642335570

this paper introduces a constraint model and solving techniques for code generation in a compiler back-end. It contributes a new model for global register allocation that combines several advanced aspects: multiple register banks (subsuming spilling to memory), coalescing, and packing. the model is extended to include instruction scheduling and bundling. the paper introduces a decomposition scheme exploiting the underlying program structure and exhibiting robust behavior for functions with thousands of instructions. Evaluation shows that code quality is on par with LLVM, a state-of-the-art compiler infrastructure. the paper makes important contributions to the applicability of constraint programming as well as compiler construction: essential concepts are unified in a high-level model that can be solved by readily available modern solvers. this is a significant step towards basing code generation entirely on a high-level model and by this facilitates the construction of correct, simple, flexible, robust, and high-quality code generators. © 2012 Springer-Verlag.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Improved bounded max-sum for distributed constraint optimization

Improved bounded max-sum for distributed constraint optimiza...

引用

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

作者： Rollon, Emma Larrosa, Javier Departament de Llenguatges I Sistemes Informàtics Universitat Politècnica de Catalunya Spain

ISBN: (纸本)9783642335570

Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirically proved to be within a small percentage of the optimal solution on low and moderately dense problems, in this paper we show that its theoretical approximation ratio is overestimated, thus overshadowing its good performance. We propose a new algorithm, called Improved Bounded Max-Sum, whose approximate solutions are at least as good as the ones found by Bounded Max-Sum and with a tighter approximation ratio. Our empirical evaluation shows that the new approximation ratio is significantly tighter. © 2012 Springer-Verlag.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A generic method for identifying and exploiting dominance relations

A generic method for identifying and exploiting dominance re...

引用

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

作者： Chu, Geoffrey Stuckey, Peter J. National ICT Australia Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9783642335570

Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions of dominance breaking, and a generic method for identifying and exploiting dominance relations via dominance breaking constraints. We also give a generic proof of the correctness and compatibility of symmetry breaking constraints, conditional symmetry breaking constraints and dominance breaking constraints. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Comparing solution methods for the machine reassignment problem

Comparing solution methods for the machine reassignment prob...

引用

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

作者： Mehta, Deepak O'Sullivan, Barry Simonis, Helmut Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642335570

the machine reassignment problem is defined by a set of machines and a set of processes. Each machine is associated with a set of resources, e.g. cpU, RAM etc., and each process is associated with a set of required resource values and a currently assigned machine. the task is to reassign the processes to machines while respecting a set of hard constraints in order to improve the usage of the machines, as defined by a complex cost function. We present a natural constraint programming (cp) formulation of the problem that uses a set of well-known global constraints. However, this formulation also requires new global constraints. Additionally, the instances are so large that systematic search is not practical especially when the time is limited. We therefore developed a cp formulation of the problem that is especially suited for a large neighborhood search approach (LNS). We also experimented with a mixed-integer programming (MIP) model for LNS. We first compare our formulations on a set of ROADEF'12 problem instances where the number of processes and machines are restricted to 1000 and 100 respectively. Both MIP and cp-based LNS approaches find solutions that are significantly better than the initial ones and compare well to other submitted entries. We further investigate their performances on larger instances where the number of processes and machines can be up to 50000 and 5000 respectively. the results suggest that our cp-based LNS can scale to large instances and is superior in memory use and the quality of solutions that can be found in limited time. © 2012 Springer-Verlag.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

the SeqBin constraint revisited

The SeqBin constraint revisited

引用

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

作者： Katsirelos, George Narodytska, Nina Walsh, Toby UBIA INRA Toulouse France NICTA UNSW Sydney Australia

ISBN: (纸本)9783642335570

We revisit the SeqBin constraint [1]. this meta-constraint subsumes a number of important global constraints like Change [2], Smooth [3] and IncreasingNValue [4]. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong restrictions: it does not detect bounds disentailment and it is not idempotent. We identify the cause for these problems, and propose a new propagator that overcomes both issues. Our algorithm is based on a connection to the problem of finding a path of a given cost in a restricted n-partite graph. Our propagator enforces domain consistency in O(nd 2) and, for special cases of SeqBin that include Change, Smooth and IncreasingNValue in O(nd) time. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Breaking Symmetries with RootClique and LexTopSort 26th

Breaking Symmetries with RootClique and LexTopSort

引用

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

作者： Fichte, Johannes K. Hecher, Markus Szeider, Stefan School of Engineering Sciences TU Dresden Dresden Germany Database and Artificial Intelligence Group TU Wien Vienna Austria Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783030584740

Bounded fractional hypertree width is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Fichte et al. (cp 2018) presented a robust and scalable method for finding optimal fractional hypertree decompositions, based on an encoding to SAT Modulo theory (SMT). In this paper, we provide an in-depth study of two powerful symmetry breaking predicates that allow us to further speed up the SMT-based decomposition: RootClique fixes the root of the decomposition tree;LexTopSort fixes the elimination ordering with respect to an underlying DAG. We perform an extensive empirical evaluation of both symmetry-breaking predicates with respect to the primal graph (which is known in advance) and the induced graph (which is generated during the search). © 2020, Springer Nature Switzerland AG.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

the semigroups of order 10

The semigroups of order 10

引用

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

作者： Distler, Andreas Jefferson, Chris Kelsey, Tom Kotthoff, Lars Centro de Álgebra Universidade de Lisboa Lisboa 1649-003 Portugal School of Computer Science University of St. Andrews KY16 9SX United Kingdom

ISBN: (纸本)9783642335570

the number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed constraint Satisfaction to show that the number of non-equivalent semigroups of order 10 is 12,418,001,077,381,302,684. this solves a previously open problem in Mathematics, and has directly led to improvements in constraint Satisfaction technology. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Exploring chemistry using SMT

Exploring chemistry using SMT

引用

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

作者： Fagerberg, Rolf Flamm, Christoph Merkle, Daniel Peters, Philipp Department of Mathematics and Computer Science University of Southern Denmark Denmark Institute for Theoretical Chemistry University of Vienna Austria

ISBN: (纸本)9783642335570

How to synthesize molecules is a fundamental and well studied problem in chemistry. However, computer aided methods are still under-utilized in chemical synthesis planning. Given a specific chemistry (a set of chemical reactions), and a specified overall chemical mechanism, a number of exploratory questions are of interest to a chemist. Examples include: what products are obtainable, how to find a minimal number of reactions to synthesize a certain chemical compound, and how to map a specific chemistry to a mechanism. We present a constraint programming based approach to these problems and employ the expressive power of Satisfiability Modulo theory (SMT) solvers. We show results for an analysis of the Pentose Phosphate Pathway and the Biosynthesis of 3-Hydroxypropanoate. the main novelty of the paper lies in the usage of SMT for expressing search problems in chemistry, and in the generality of its resulting computer aided method for synthesis planning. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Dimensioning an inbound call center using constraint programming

引用

11th international conference on principles and practice of constraint programming - cp 2005

作者： Canon, Cyril Billaut, Jean-Charles Bouquard, Jean-Louis Vitalicom 643 avenue du grain d'or 41350 Vineuil France Université François-Rabelais de Tours Laboratoire d'Informatique 64 avenue Jean Portails 37200 Tours France

ISBN: (纸本)3540292381

One of the critical problems in the call center industries is the staffing problem, since they must face variable demands and because staff costs represent a major part of the costs of these industries. Prom a modeling point of view, a call center is generally modeled as a M/M/N system, also called the Erlang-C model. In [Koole and Mandelbaurn, 2001], the authors present a survey of the state-of-the-art about possible models of a call center. In this paper, the problem of dimensioning a call center is modeled as a deterministic scheduling problem, where resources represent the employees and jobs correspond to the calls that are received. To each resource are associated tools that correspond to the skills of employees, and a weigth corresponding to the cost of employment. To each job are associated a release date, a processing time, a deadline and a required tool. the objective is to schedule jobs so as to minimize the weighted number of resources needed to perform the jobs. For solving this problem, we propose exact methods based on constraint programming Models. three different models are presented. the second one is an improvement of the first one, both in terms of constraints definitions and instanciation methods. the last one introduces redundant constraints to speed up the resolution process. An approximated algorithm is also proposed, based on a priority rule and an assignment rule. We also compare our models to a Mixed Integer Linear Program, solved by cpLEX. Instances are randomly generated with around 45 resources and from 20 to 200 jobs. Feasible solutions are always obtained within two minutes by using these methods. cp models are solved using Eclipse 5.8-77 software with the time limit fixed to two minutes on a PC Pentium III, 1.4 GHz, 512 Mo. cp can solve the problem optimally with up to 80 jobs. For more than 100 jobs, the upper bound given by the heuristic algorithm is never improved within two minutes. © Springer-Verlag Berlin Heidelberg 2005.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：