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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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 weighted average constraint

The weighted average constraint

引用

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

作者： Bonfietti, Alessio Lombardi, Michele DEIS University of Bologna Italy

ISBN: (纸本)9783642335570

Weighted average expressions frequently appear in the context of allocation problems with balancing based constraints. In combinatorial optimization they are typically avoided by exploiting problems specificities or by operating on the search process. this approach fails to apply when the weights are decision variables and when the average value is part of a more complex expression. In this paper, we introduce a novel average constraint to provide a convenient model and efficient propagation for weighted average expressions appearing in a combinatorial model. this result is especially useful for Empirical Models extracted via Machine Learning (see [2]), which frequently count average expressions among their inputs. We provide basic and incremental filtering algorithms. the approach is tested on classical benchmarks from the OR literature and on a workload dispatching problem featuring an Empirical Model. In our experimentation the novel constraint, in particular with incremental filtering, proved to be even more efficient than traditional techniques to tackle weighted average expressions. © 2012 Springer-Verlag.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

HADDOCK: A Language and Architecture for Decision Diagram Compilation 26th

HADDOCK: A Language and Architecture for Decision Diagram C...

引用

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

作者： Gentzel, Rebecca Michel, Laurent van Hoeve, W.-J. University of Connecticut StorrsCT06269 United States Carnegie Mellon University PittsburghPA15213 United States

ISBN: (纸本)9783030584740

Multi-valued decision diagrams (MDDs) were introduced into constraint programming over a decade ago as a powerful alternative to domain propagation. While effective MDD-propagation algorithms have been proposed for various constraints, to date no system exists that can generically compile and combine MDD propagation for arbitrary constraints. To fill this need, we introduce Haddock, a declarative language and architecture for MDD compilation. Haddock supports the specification, implementation, and composition of a broad range of MDD propagators that delivers the strength one expects from MDDs at a fraction of the development effort and with comparable performance. this paper describes the language, the framework architecture, outlines its performance credentials and demonstrates how to specify and implement novel MDD propagators. © 2020, Springer Nature Switzerland AG.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

7th international conference on the theory and practice of Natural Computing, TPNC 2018

7th International Conference on the Theory and Practice of N...

引用

7th international conference on the theory and practice of Natural Computing, TPNC 2018

ISBN: (纸本)9783030040697

the proceedings contain 36 papers. the special focus in this conference is on theory and practice of Natural Computing. the topics include: A linear constrained optimization benchmark for probabilistic search algorithms: the rotated klee-minty problem;the design of (almost) disjunct matrices by evolutionary algorithms;how the “Baldwin Effect” can guide evolution in dynamic environments;landscape-aware constraint handling applied to differential evolution;fuel efficient truck platooning with time restrictions and multiple speeds solved by a particle swarm optimisation;automated design of genetic programming classification algorithms for financial forecasting using evolutionary algorithms;optimizing fleet staging of air ambulances in the Province of Ontario;a Hierarchical approach to grammar-guided genetic programming: the case of scheduling in heterogeneous networks;multi-memetic mind evolutionary computation algorithm based on the landscape analysis;computing preimages and ancestors in reaction systems;DNA-guided assembly of nanocellulose meshes;classically time-controlled quantum automata;mortal organisms rescue immortal organisms from evolutionary inertness: Perspective of the programmed self-decomposition model;integrative biological, cognitive and affective modeling of a drug-therapy for a post-traumatic stress disorder;symbolic analysis of machine behaviour and the emergence of the machine language;it is time to dissolve old dichotomies in order to grasp the whole picture of cognition;network-oriented modeling of the interaction of adaptive joint decision making, bonding and mirroring;network reification as a unified approach to represent network adaptation principles within a network;relating an adaptive network’s structure to its emerging behaviour for Hebbian learning;on capacity with incremental learning by simplified chaotic neural network.

关键词：

来源：评论

学校读者我要写书评

暂无评论

constraint propagation for soft constraints: Generalization and termination conditions 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Bistarelli, S. Gennari, R. Rossi, F. Università di Pisa Dipartimento di Informatica Corso Italia 40 Pisa56125 Italy ILLC Institute of Logic Language and Computation University of Amsterdam N. Doelenstraat 15 Amsterdam1012 CP Netherlands Università di Padova Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy

ISBN: (纸本)3540410538

Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. this framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema. In this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A framework for decision-based consistencies

A framework for decision-based consistencies

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Condotta, Jean-François Lecoutre, Christophe CRIL - CNRS UMR 8188 Univ Lille Nord de France Artois LensF-62307 France

ISBN: (纸本)9783642237850

Consistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most often, variable assignments) and stronger than (generalized) arc consistency have been introduced. In this paper, our ambition is to present a clear picture of decision-based consistencies. We identify four general classes (or levels) of decision-based consistencies, denoted by SφΔ, EφΔ, DφΔ and, study their relationships, and show that known consistencies are particular cases of these classes. Interestingly, this general framework provides us with a better insight into decision-based consistencies, and allows us to derive many new consistencies that can be directly integrated and compared with other ones. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A model seeker: Extracting global constraint models from positive examples

A model seeker: Extracting global constraint models from pos...

引用

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

作者： Beldiceanu, Nicolas Simonis, Helmut Mines de Nantes France Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642335570

We describe a system which generates finite domain constraint models from positive example solutions, for highly structured problems. the system is based on the global constraint catalog, providing the library of constraints that can be used in modeling, and the constraint Seeker tool, which finds a ranked list of matching constraints given one or more sample call patterns. We have tested the modeler with 230 examples, ranging from 4 to 6,500 variables, using between 1 and 7,000 samples. these examples come from a variety of domains, including puzzles, sports-scheduling, packing & placement, and design theory. When comparing against manually specified "canonical" models for the examples, we achieve a hit rate of 50%, processing the complete benchmark set in less than one hour on a laptop. Surprisingly, in many cases the system finds usable candidate lists even when working with a single, positive example. © 2012 Springer-Verlag.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Filtering algorithms for discrete cumulative problems with overloads of resource

Filtering algorithms for discrete cumulative problems with o...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： De Clercq, Alexis Petit, thierry Beldiceanu, Nicolas Jussien, Narendra École des Mines de Nantes LINA UMR CNRS 6241 4 rue Alfred Kastler NantesFR-44307 France

ISBN: (纸本)9783642237850

Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. Moreover, this capacity is not necessarily always the same during the scheduling period. this article introduces a new constraint for solving this class of problems. We adapt two filtering algorithms to our context: Sweep and P. Vilím’s Edge-Finding algorithm. We emphasize that in some problems violations are imposed. We design a new filtering procedure specific to this kind of events. We introduce a search heuristic specific to our constraint. We successfully experiment our constraint. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Pruning rules for constrained optimisation for conditional preferences

Pruning rules for constrained optimisation for conditional p...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Wilson, Nic Trabelsi, Walid Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642237850

A depth-first search algorithm can be used to find optimal solutions of a constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a cp-net). this involves checking at each leaf node if the corresponding solution of the CSP is dominated by any of the optimal solutions found so far;if not, then we add this solution to the set of optimal solutions. this kind of algorithm can clearly be computationally expensive if the number of solutions is large. At a node N of the search tree, with associated assignment b to a subset of the variables B, it may happen that, for some previously found solution α, either (a) α dominates all extensions of b;or (b) α does not dominate any extension of a. the algorithm can be significantly improved if we can find sufficient conditions for (a) and (b) that can be efficiently checked. In case (a), we can backtrack since we need not continue the search below N;in case (b), α does not need to be considered in any node below the current node N. We derive a sufficient condition for (b), and three sufficient conditions for (a). Our experimental testing indicates that this can make a major difference to the efficiency of constrained optimisation for conditional preference theories including cp-nets. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A characterisation of the complexity of forbidding subproblems in binary max-CSP

A characterisation of the complexity of forbidding subproble...

引用

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

作者： Cooper, Martin C. Escamocher, Guillaume Živný, Stanislav IRIT University of Toulouse III 31062 Toulouse France Department of Computer Science University of Oxford OX1 3QD Oxford United Kingdom

ISBN: (纸本)9783642335570

Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary Max-CSP instances defined by forbidding a single subproblem. In the resulting dichotomy, the only non-trivial tractable class defined by a forbidden subproblem corresponds to the set of instances satisfying the so-called joint-winner property. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：