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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

62 篇 会议
1 册 图书

馆藏范围

63 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 13 篇 软件工程
- 1 篇 电气工程
- 1 篇 交通运输工程
48 篇 理学
- 44 篇 数学
- 14 篇 系统科学
- 1 篇 统计学（可授理学、...
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

12 篇 constraint satis...
12 篇 constraint theor...
5 篇 computer program...
3 篇 linear programmi...
3 篇 constraint progr...
1 篇 bandit
1 篇 constraint logic...
1 篇 query languages
1 篇 inverse problems
1 篇 large neighborho...
1 篇 problem solving
1 篇 chaotic dynamica...
1 篇 modeling languag...
1 篇 adaptive search
1 篇 concolic testing
1 篇 soft neighborhoo...
1 篇 containers
1 篇 optimal systems
1 篇 redundancy
1 篇 iterative method...

机构

2 篇 cork constraint ...
2 篇 université côte ...
2 篇 univ coll cork c...
2 篇 univ melbourne m...
2 篇 faculty of elect...
1 篇 free univ amster...
1 篇 univ st andrews ...
1 篇 université côte ...
1 篇 univ nantes lina...
1 篇 tech univ catalo...
1 篇 nicta nsw
1 篇 univ melbourne n...
1 篇 antwerp maritime...
1 篇 univ melbourne d...
1 篇 ujf cnrs grenobl...
1 篇 univ york york y...
1 篇 univ artois cnrs...
1 篇 cnrs lirmm f-343...
1 篇 univ autonoma ba...
1 篇 algorithms and c...

作者

5 篇 stuckey peter j.
4 篇 régin jean-charl...
3 篇 pearson justin
3 篇 werner tomáš
3 篇 chu geoffrey
3 篇 dlask tomáš
3 篇 flener pierre
3 篇 o'sullivan barry
2 篇 prestwich steven...
2 篇 thorstensen evge...
2 篇 isoart nicolas
2 篇 miguel ian
2 篇 nightingale pete...
2 篇 gent ian p.
2 篇 de givry simon
2 篇 schaus pierre
1 篇 schoenauer marc
1 篇 prestwich steven
1 篇 fargier helene
1 篇 fontaine daniel

语言

63 篇 英文

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

共 63 条记录，以下是51-60 订阅

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

详细简洁

排序：

Inter-instance nogood learning in constraint programming

Inter-instance nogood learning in constraint programming

引用

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

Lazy Clause Generation is a powerful approach to reducing search in constraint programming. this is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators called nogoods. this dramatically reduces the search and provides orders of magnitude speedups on a wide range of problems. Current implementations of Lazy Clause Generation only allows solvers to learn and utilize nogoods within an individual problem. this means that everything the solver learns will be forgotten as soon as the current problem is finished. In this paper, we show how Lazy Clause Generation can be extended so that nogoods learned from one problem can be retained and used to significantly speed up the solution of other, similar problems. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Bounds on Weighted CSPs using constraint propagation and super-reparametrizations 27

Bounds on Weighted CSPs using constraint propagation and sup...

引用

27th international conference on principles and practice of constraint programming, cp 2021

作者： Dlask, Tomáš Werner, Tomáš De Givry, Simon Faculty of Electrical Engineering Czech Technical University in Prague Czech Republic Université Fédérale de Toulouse ANITI INRAE UR 875 France

ISBN: (纸本)9783959772112

We propose a framework for computing upper bounds on the optimal value of the (maximization version of) Weighted CSP (WCSP) using super-reparametrizations, which are changes of the weights that keep or increase the WCSP objective for every assignment. We show that it is in principle possible to employ arbitrary (under certain technical conditions) constraint propagation rules to improve the bound. For arc consistency in particular, the method reduces to the known Virtual AC (VAC) algorithm. Newly, we implemented the method for singleton arc consistency (SAC) and compared it to other strong local consistencies in WCSPs on a public benchmark. the results show that the bounds obtained from SAC are superior for many instance groups. © 2021 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

On Redundancy in constraint Satisfaction Problems 28

On Redundancy in Constraint Satisfaction Problems

引用

28th international conference on principles and practice of constraint programming, cp 2022

作者： Carbonnel, Clément CNRS LIRMM University of Montpellier France

ISBN: (纸本)9783959772402

A constraint language Γ has non-redundancy f(n) if every instance of CSP(Γ) with n variables contains at most f(n) non-redundant constraints. If Γ has maximum arity r then it has non-redundancy O(nr), but there are notable examples for which this upper bound is far from the best possible. In general, the non-redundancy of constraint languages is poorly understood and little is known beyond the trivial bounds Ω(n) and O(nr). In this paper, we introduce an elementary algebraic framework dedicated to the analysis of the non-redundancy of constraint languages. this framework relates redundancy-preserving reductions between constraint languages to closure operators known as pattern partial polymorphisms, which can be interpreted as generic mechanisms to generate redundant constraints in CSP instances. We illustrate the power of this framework by deriving a simple characterisation of all languages of arity r having non-redundancy Θ(nr). © Clément Carbonnel.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Bounding Linear Programs by constraint Propagation: Application to Max-SAT 26th

Bounding Linear Programs by Constraint Propagation: Applicat...

引用

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

作者： Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic

ISBN: (纸本)9783030584740

the Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this technique by replacing arc consistency with a (problem-dependent) constraint propagation in a system of linear inequalities over the reals. When propagation detects infeasibility, the infeasibility certificate (a solution to the alternative system in Farkas’ lemma) provides a dual improving direction. We illustrate this approach on the LP relaxation of Weighted Max-SAT. We show in experiments that the obtained bounds are often not far from global LP optima and we prove that they are exact for known tractable subclasses of Weighted Max-SAT. © 2020, Springer Nature Switzerland AG.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

On Relation Between constraint Propagation and Block-Coordinate Descent in Linear Programs 26th

On Relation Between Constraint Propagation and Block-Coordin...

引用

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

作者： Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic

ISBN: (纸本)9783030584740

Block-coordinate descent (BCD) is a popular method in large-scale optimization. Unfortunately, its fixed points are not global optima even for convex problems. A succinct characterization of convex problems optimally solvable by BCD is unknown. Focusing on linear programs, we show that BCD fixed points are identical to fixed points of another method, which uses constraint propagation to detect infeasibility of a system of linear inequalities in a primal-dual loop (a special case of this method is the Virtual Arc Consistency algorithm by Cooper et al.). this implies that BCD fixed points are global optima iff a certain propagation rule decides feasibility of a certain class of systems of linear inequalities. © 2020, Springer Nature Switzerland AG.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

ACM international conference Proceeding Series

ACM International Conference Proceeding Series

引用

19th international Symposium on principles and practice of Declarative programming, PPDP 2017

ISBN: (纸本)9781450352918

the proceedings contain 20 papers. the topics discussed include: ethical issues in data management;programming by examples: applications, algorithms, and ambiguity resolution;environments and the complexity of abstract machines;conditional narrowing modulo SMT and axioms;attribute grammars with set attributes and global constraints as a unifying framework for planning domain models;shrink fast correctly!;function definitions for compound values in object-oriented languages;verifiable semantic difference languages;theory learning with symmetry breaking;copattern-matchings and first-class observations in OCaml, with a macro;practical evaluation of the lasp programming model at large scale - an experience report;selective unification in constraint logic programming;causally consistent reversible choreographies: a monitors-as-memories approach;machine fusion: merging merges, more or less;alpha-renaming of higher-order meta-expressions;characterization of strong normalizability for a sequent lambda calculus with co-control;defunctionalisation as modular closure conversion;a core calculus for provenance for provenance inspection;and expressive and strongly type-safe code generation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MDD Archive for Boosting the Pareto constraint 29

MDD Archive for Boosting the Pareto Constraint

引用

29th international conference on principles and practice of constraint programming, cp 2023

作者： Malalel, Steve Malapert, Arnaud Pelleau, Marie Régin, Jean-Charles Université Côte d'Azur CNRS I3S Nice France

ISBN: (纸本)9783959773003

Multi-objective problems are frequent in the real world. In general they involve several incomparable objectives and the goal is to find a set of Pareto optimal solutions, i.e. solutions that are incomparable two by two. In order to better deal with these problems in cp the global constraint Pareto was developed by Schaus and Hartert to handle the relations between the objective variables and the current set of Pareto optimal solutions, called the archive. this constraint handles three operations: adding a new solution to the archive, removing solutions from the archive that are dominated by a new solution, and reducing the bounds of the objective variables. the complexity of these operations depends on the size of the archive. In this paper, we propose to use a multi-valued Decision Diagram (MDD) to represent the archive of Pareto optimal solutions. MDDs are a compressed representation of solution sets, which allows us to obtain a compressed and therefore smaller archive. We introduce several algorithms to implement the above operations on compressed archives with a complexity depending on the size of the archive. We show experimentally on bin packing and multi-knapsack problems the validity of our approach. © Steve Malalel, Arnaud Malapert, Marie Pelleau, and Jean-Charles Régin.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

A framework for constraint programming based column generation 5th

引用

5th international conference on principles and practice of constraint programming, cp 1999

作者： Junker, Ulrich Karisch, Stefan E. Kohl, Niklas Vaaben, Bo Fahle, Torsten Sellmann, Meinolf ILOG S.A. 1681 route des Dolines ValbonneF-06560 France Carmen Systems AB Odinsgatan 9 GothenburgS-41103 Sweden Technical University of Denmark Department of Mathematical Modelling Building 321 LyngbyDK-2800 Denmark University of Paderborn Department of Mathematics and Computer Science Fürstenallee 11 PaderbornD-33102 Germany

ISBN: (纸本)3540666265

Column generation is a state-of-the-art method for optimally solving difficult large-scale optimization problems such as airline crew assignment. We show how to apply column generation even if those problems have complex constraints that are beyond the scope of pure OR methods. We achieve this by formulating the subproblem as a constraint satisfaction problem(C SP). We also show how to efficiently treat the special case of shortest path problems by introducing an efficient path constraint that exploits dual values from the master problem to exclude nodes that will not lead to paths with negative reduced costs. We demonstrate that this propagation significantly reduces the time needed to solve crew assignment problems. © Springer-Verlag Berlin Heidelberg 1999.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Consistency maintenance for ABT 1

引用

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

作者： Silaghi, Marius-Călin Sam-Haroud, Djamila Faltings, Boi EPFL CH-1015 Switzerland

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such a combination in asynchronous settings1. the difficulty in this case is that, in the usual algorithms, the instantiation and consistency enforcement steps must alternate sequentially. When brought to a distributed setting, a similar approach forces the search algorithm to be synchronous in order to benefit from consistency maintenance. Asynchronism [24,14] is highly desirable since it increases flexibility and parallelism, and makes the solving process robust against timing variations. One of the most well-known asynchronous search algorithms is Asynchronous Backtracking (ABT). this paper shows how an algorithm for maintaining consistency during distributed asynchronous search can be designed upon ABT. the proposed algorithm is complete and has polynomial-space complexity. Since the consistency propagation is optional, this algorithms generalizes forward checking as well as chronological backtracking. An additional advance over existing centralized algorithms is that it can exploit available backtracking-nogoods for increasing the strength of the maintained consistency. the experimental evaluation shows that it can bring substantial gains in computational power compared with existing asynchronous algorithms. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：