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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

167 篇 会议
12 篇 期刊文献
5 册 图书

馆藏范围

183 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

151 篇 工学
- 145 篇 计算机科学与技术...
- 78 篇 软件工程
- 8 篇 信息与通信工程
- 6 篇 电气工程
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 1 篇 材料科学与工程（可...
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 化学工程与技术
56 篇 理学
- 45 篇 数学
- 37 篇 系统科学
- 1 篇 化学
- 1 篇 统计学（可授理学、...
4 篇 管理学
- 4 篇 管理科学与工程(可...
- 1 篇 工商管理
2 篇 农学
- 2 篇 作物学
1 篇 军事学

主题

37 篇 constraint satis...
31 篇 constraint theor...
12 篇 constraint progr...
6 篇 local search
5 篇 global constrain...
5 篇 constraint
4 篇 software enginee...
4 篇 incremental
4 篇 symmetry
4 篇 mathematical log...
4 篇 artificial intel...
3 篇 modeling
3 篇 problem solving
3 篇 integer programm...
3 篇 programming tech...
3 篇 programming lang...
3 篇 logics and meani...
2 篇 constraint proce...
2 篇 solution countin...
2 篇 meta-heuristic

机构

8 篇 brown univ provi...
6 篇 natl univ irelan...
6 篇 cork constraint ...
4 篇 univ st andrews ...
4 篇 univ st andrews ...
4 篇 univ connecticut...
3 篇 ilog 9 avenue de...
3 篇 max planck inst ...
3 篇 univ oxford comp...
3 篇 univ waterloo sc...
2 篇 univ st andrews ...
2 篇 univ nice sophia...
2 篇 univ pompeu fabr...
2 篇 univ potsdam pot...
2 篇 aalto univ aalto
2 篇 inria rennes ren...
2 篇 ensieta f-29806 ...
2 篇 univ coll cork c...
2 篇 univ st andrews ...
2 篇 natl univ singap...

作者

10 篇 gent ian p.
9 篇 miguel ian
9 篇 nightingale pete...
7 篇 smith barbara m.
6 篇 jefferson christ...
6 篇 o’sullivan barry
6 篇 freuder eugene c...
5 篇 van hentenryck p
5 篇 jeavons peter
5 篇 puget jean-franç...
4 篇 stuckey peter j.
4 篇 michel l
4 篇 kelsey tom
4 篇 kotthoff lars
4 篇 cohen david a.
3 篇 van hentenryck p...
3 篇 schaub torsten
3 篇 rueher michel
3 篇 jefferson chris
3 篇 katriel i

语言

183 篇 英文
1 篇 中文

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

共 184 条记录，以下是171-180 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

An impartial efficiency comparison of FD constraint systems 4th

引用

4th international conference on principles and practice of constraint programming, cp 1998

作者： Fernández, Antonio J. Hill, Patricia M. Departamento de Lenguajes y Ciencias de la Computación E.T.S.I.I. Teatinos Málaga29071 Spain School of Computer Studies University of Leeds LeedsLS2 9JT United Kingdom

ISBN: (纸本)3540652248

CLP systems differ significantly in the efficiency of their execution so that a wrong choice for an application may be disastrous relative to the necessary performance. thus, efficiency should be taken into account when choosing the best system for a particular application. In spite of this, there appeared to be no impartial efficiency information concerning CLP systems. In the research described here, we have compared, as fairly as possible, eight systems and provided detailed results concerning their speed and robustness. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

PW-AC: Extending compact-table to enforce pairwise consistency on table constraints 24th

PW-AC: Extending compact-table to enforce pairwise consisten...

引用

24th international conference on the principles and practice of constraint programming, cp 2018

作者： Schneider, Anthony Choueiry, Berthe Y. Constraint Systems Laboratory University of Nebraska-Lincoln Lincoln United States

ISBN: (纸本)9783319983332

the Compact-Table (CT) algorithm is the current state-of-the-art algorithm for enforcing Generalized Arc Consistency (GAC) on table constraints during search. Recently, algorithms for enforcing Pairwise Consistency (PWC), which is strictly stronger than GAC, were shown to be advantageous for solving difficult problems. However, PWC algorithms can be costly in terms of cpU time and memory consumption. As a result, their overhead may offset the savings of search-space reduction. In this paper, we introduce PW-CT, an algorithm that modifies CT to enforce full PWC. We show that PW-CT avoids the high memory requirements of prior PWC algorithms and significantly reduces the time required to enforce PWC. © Springer Nature Switzerland AG 2018.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CSP Beyond Tractable constraint Languages 28

CSP Beyond Tractable Constraint Languages

引用

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

作者： Dreier, Jan Ordyniak, Sebastian Szeider, Stefan Algorithms and Complexity Group TU Wien Austria Algorithms and Complexity Group University of Leeds United Kingdom

ISBN: (纸本)9783959772402

the constraint satisfaction problem (CSP) is among the most studied computational problems. While NP-hard, many tractable subproblems have been identified (Bulatov 2017, Zuk 2017). Backdoors, introduced by Williams, Gomes, and Selman (2003), gradually extend such a tractable class to all CSP instances of bounded distance to the class. Backdoor size provides a natural but rather crude distance measure between a CSP instance and a tractable class. Backdoor depth, introduced by Mählmann, Siebertz, and Vigny (2021) for SAT, is a more refined distance measure, which admits the parallel utilization of different backdoor variables. Bounded backdoor size implies bounded backdoor depth, but there are instances of constant backdoor depth and arbitrarily large backdoor size. Dreier, Ordyniak, and Szeider (2022) provided fixed-parameter algorithms for finding backdoors of small depth into the classes of Horn and Krom formulas. In this paper, we consider backdoor depth for CSP. We consider backdoors w.r.t. tractable subproblems CΓ of the CSP defined by a constraint language Γ, i.e., where all the constraints use relations from the language Γ. Building upon Dreier et al.’s game-theoretic approach and their notion of separator obstructions, we show that for any finite, tractable, semi-conservative constraint language Γ, the CSP is fixed-parameter tractable parameterized by the backdoor depth into CΓ plus the domain size. With backdoors of low depth, we reach classes of instances that require backdoors of arbitrary large size. Hence, our results strictly generalize several known results for CSP that are based on backdoor size. © Jan Dreier, Sebastian Ordyniak, and Stefan Szeider.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Effective Encodings of constraint programming Models to SMT 26th

Effective Encodings of Constraint Programming Models to SMT

引用

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

作者： Davidson, Ewan Akgün, Özgür Espasa, Joan Nightingale, Peter School of Computer Science University of St Andrews St Andrews United Kingdom Department of Computer Science University of York York United Kingdom

ISBN: (纸本)9783030584740

Satisfiability Modulo theories (SMT) is a well-established methodology that generalises propositional satisfiability (SAT) by adding support for a variety of theories such as integer arithmetic and bit-vector operations. SMT solvers have made rapid progress in recent years. In part, the efficiency of modern SMT solvers derives from the use of specialised decision procedures for each theory. In this paper we explore how the Essence Prime constraint modelling language can be translated to the standard SMT-LIB language. We target four theories: bit-vectors (QF_BV), linear integer arithmetic (QF_LIA), non-linear integer arithmetic (QF_NIA), and integer difference logic (QF_IDL). the encodings are implemented in the constraint modelling tool Savile Row. In an extensive set of experiments, we compare our encodings for the four theories, showing some notable differences and complementary strengths. We also compare our new encodings to the existing work targeting SMT and SAT, and to a well-established learning cp solver. Our two proposed encodings targeting the theory of bit-vectors (QF_BV) both substantially outperform earlier work on encoding to QF_BV on a large and diverse set of problem classes. © 2020, Springer Nature Switzerland AG.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Improved bound computation in presence of several clique constraints

引用

10th international conference on principles and practice of constraint programming, cp 2004

作者： Puget, Jean-Francois ILOG 9 avenue de Verdun Gentilly94253 France

ISBN: (纸本)3540232419

Bound consistency can easily and efficiently be enforced on linear constraint. However, bound consistency techniques deal with every constraint separately. We show that in some cases much stronger bounds can be computed by looking globally at the set of linear constraints. A simple algorithm for computing such bounds is derived from a new decomposition scheme. We prove that these bounds can be as tight as possible. In some cases this can be better than the standard reduced cost fixings. this algorithm has been implemented within a global constraint. Experimental results on balanced incomplete block design (BIBD) show its effectiveness: we were able to significantly improve over the best published results for this class of problems. © Springer-Verlag Berlin Heidelberg 2004.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A new hybrid tractable class of soft constraint problems

A new hybrid tractable class of soft constraint problems

引用

16th international conference on principles and practice of constraint programming, cp 2010

作者： Cooper, Martin C. Živný, Stanislav IRIT University of Toulouse III 31062 Toulouse France Computing Laboratory University of Oxford OX1 3QD Oxford United Kingdom

ISBN: (纸本)364215395X

the constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractability in such problems. In this paper we study hybrid tractability of soft constraint problems;that is, properties which guarantee tractability of the given soft constraint problem, but properties which do not depend only on the underlying structure of the instance (such as being tree-structured) or only on the types of soft constraints in the instance (such as submodularity). We firstly present two hybrid classes of soft constraint problems defined by forbidden subgraphs in the structure of the instance. these classes allow certain combinations of binary crisp constraints together with arbitrary unary soft constraints. We then introduce the joint-winner property, which allows us to define a novel hybrid tractable class of soft constraint problems with soft binary and unary constraints. this class generalises the SoftAllDiff constraint with arbitrary unary soft constraints. We show that the joint-winner property is easily recognisable in polynomial time and present a polynomial-time algorithm based on maximum-flows for the class of soft constraint problems satisfying the joint-winner property. Moreover, we show that if cost functions can only take on two distinct values then this class is maximal. © 2010 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Global cut framework for removing symmetries 1

引用

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

作者： Focacci, Filippo Milano, Michaela ILOG S.A 9 rue de Verdun BP 85 GentillyF-94253 France DEIS University of Bologna V.le Risorgimento 2 40136 Italy

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

In this paper, we propose a general technique for removing symmetries in CSPs during search. the idea is to record no-goods, during the exploration of the search tree, whose symmetric counterpart (if any) should be removed. the no-good, called Global Cut Seed (GCS), is used to generate Symmetry Removal Cuts (SRCs), i.e., constraints that are dynamically generated during search and hold in the entire search tree. the propagation of SRCs removes symmetric configurations with respect to already visited states. We present a general, correct and complete filtering algorithm for SRCs. the main advantages of the proposed approach are that it is not intrusive in the problem-dependent search strategy, treats symmetries in an additive way since GCSs are symmetry independent, and enables to write filtering algorithms which handle families of symmetries together. Finally, we show that many relevant previous approaches can be seen as special cases of our framework. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：