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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,005 篇 会议
51 篇 期刊文献
20 册 图书

馆藏范围

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

日期分布

学科分类号

900 篇 工学
- 876 篇 计算机科学与技术...
- 526 篇 软件工程
- 45 篇 信息与通信工程
- 29 篇 电气工程
- 22 篇 控制科学与工程
- 10 篇 机械工程
- 6 篇 建筑学
- 6 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 农业工程
- 5 篇 生物工程
- 4 篇 动力工程及工程热...
- 3 篇 航空宇航科学与技...
- 3 篇 环境科学与工程（可...
551 篇 理学
- 436 篇 数学
- 283 篇 系统科学
- 19 篇 统计学（可授理学、...
- 11 篇 物理学
- 8 篇 生物学
- 5 篇 化学
84 篇 管理学
- 69 篇 管理科学与工程(可...
- 44 篇 工商管理
- 18 篇 图书情报与档案管...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
5 篇 农学
- 5 篇 作物学
2 篇 教育学
- 2 篇 教育学
1 篇 军事学

主题

197 篇 constraint theor...
162 篇 constraint satis...
64 篇 constraint progr...
26 篇 constrained opti...
26 篇 logic programmin...
24 篇 computer program...
24 篇 answer set progr...
21 篇 integer programm...
18 篇 scheduling
15 篇 artificial intel...
15 篇 dynamic programm...
14 篇 mathematical log...
13 篇 problem solving
12 篇 linear programmi...
12 篇 programming lang...
10 篇 global constrain...
10 篇 logics and meani...
9 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...

机构

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

作者

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

语言

1,073 篇 英文
3 篇 中文

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

共 1076 条记录，以下是841-850 订阅

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

详细简洁

排序：

Validated constraint compilation 5th

引用

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

作者： Hickey, Timothy J. Wittenberg, David K. Computer Science Department Brandeis University United States

ISBN: (纸本)3540666265

Inaccurate scientific computation is useless at best and dangerous at worst. We address several major sources of inaccuracy. Roundoff error is well known and there is a great deal of work on minimizing it [Act96,Tay97]. By using interval constraints, we dont eliminate roundoff error, but we make it explicit, so each answer comes with a clear indication of its accuracy. Another source of error arises from misapplying an algorithm (e.g. starting the Newton method with a poor initial choice, or using a method in a case where it does not perform well). We propose a method for reducing the chance of numerical errors in scientific programming by casting the problem as the design of an appropriate constraint solving algorithm and then separating the algorithm design process into two steps.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A constraint programming approach for the traveling purchaser problem

A constraint programming approach for the traveling purchase...

引用

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

作者： Cambazard, Hadrien Penz, Bernard G-SCOP Université de Grenoble / Grenoble-INP / UJF-Grenoble 1 / CNRS France

ISBN: (纸本)9783642335570

We present a novel approach to the Traveling Purchaser Problem (TPP), based on constraint programming and Lagrangean relaxation. the TPP is a generalization of the Traveling Salesman Problem involved in many real-world applications. Given a set of markets providing products at different prices and a list of products to be purchased, the problem is to determine the route minimizing the sum of the traveling and purchasing costs. We propose in this paper an efficient approach when the number of markets visited in an optimal solution is low. We believe that the real-world applications of this problem often assume a bounded number of visits when they involve a physical routing. It is an actual requirement from our industrial partner which is developing a web application to help their customers' shopping planning. the approach is tested on academic benchmarks. It proves to be competitive with a state of the art branch-and-cut algorithm and can provide in some cases new optimal solutions for instances with up to 250 markets and 200 products. © 2012 Springer-Verlag.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Solving the Kirkman’s schoolgirl problem in a few seconds 8th

引用

8th international conference on principles and practice of constraint programming, CP 2002

作者： Barnier, Nicolas Brisset, Pascal Centre d Etudes de la Navigation Aérienne Toulouse France école Nationale de l’Aviation Civile Toulouse France

ISBN: (纸本)3540441204

the Social Golfer Problem has been extensively used in recent years by the constraint community as an example of highly symmetric problem. It is an excellent problem for benchmarking symmetry breaking mechanisms such as SBDS or SBDD and for demonstrating the importance of the choice of the right model for one problem. We address in this paper a specific instance of the Golfer Problem well known as the Kirkman’s Schoolgirl Problem and list a collection of techniques and tricks to find efficiently all its unique solutions. In particular, we propose SBDD+, an generic improvement over SBDD which allows a deep pruning when a symmetry is detected during the search. Our implementation of the presented techniques allows us to improve previous published results by an order of magnitude for CPU time as well as number of backtracks, and to compute the seven unique solutions of the Kirkman’s problem in a few seconds. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Greater efficiency for conditional constraint satisfaction

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Sabin, Mihaela Freuder, Eugene C. Wallace, Richard J. Department of Mathematics and Computer Science Rivier College 420 Main Street NashuaNH03060 United States Cork Constraint Computation Center Department of Computer Science University College Cork Cork Ireland

ISBN: (纸本)3540202021

A conditional constraint satisfaction problem (CCSP) extends a standard constraint satisfaction problem (CPS) with a conditionbased component that controls what variables participate in problem solutions. CCSPs adequately represent configuration and design problems in which selected subsets of variables, rather than the entire variable set, are relevant to final solutions. the only algorithm that is available for CCSP and operates directly on the original, unreformulated CCSP statement has been basic backtrack search. Reformulating CCSPs into standard CSPs has been proposed in order to bring the full arsenal of CSP algorithms to bear. One reformulation approach adds null values to variable domains and transforms CCSP constraints into CSP constraints. However, a complete null-based reformulation of CCSPs has not been available. In this paper we provide more advanced algorithms for CCSP and a full null-based reformulation into standard CSP. thorough testing reveals that the advanced algorithms perform up to two orders of magnitude better than plain backtracking, but that realizing practical advantages from reformulation is problematic. the advanced algorithms extend forward checking and maintaining arc consistency to CCSPs. the null-based reformulation improves on the preliminary findings in [1] by removing the limitation on multiple activation, and by localizing changes. It identifies and addresses a difficulty presented by activity cycles. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Tractability by approximating constraint languages

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Green, Martin J. Cohen, David A. Department of Computer Science Royal Holloway University of London United Kingdom

ISBN: (纸本)3540202021

A constraint satisfaction problem instance consists of a collection of variables that need to have values assigned to them. the assignments are limited by constraints that force the values taken by certain collections of variables (the constraint scopes) to satisfy specified properties (the constraint relations). As the general CSP problem is NP-hard there has been significant effort devoted to discovering tractable subproblems of the CSP. the structure of a CSP instance is defined to be the hypergraph formed by the constraint scopes. Restricting the possible structure of the CSP instances has been a successful way of identifying tractable subproblems. the language of a CSP instance is defined to be the set of constraint relations of the instance. Restricting the language allowed for CSP instances has also yielded many interesting tractable subproblems. Almost all known tractable subproblems are either structural or relational. In this paper we construct tractable subproblems of the general CSP that are neither defined by structural nor relational properties. these new tractable classes are related to tractable languages in much the same way that general decompositions (cutset, tree-clustering, etc.) are related to acyclic decompositions. It may well be that our results will begin to make language based tractability of more practical interest. We show that our theory allows us to properly extend the binary maxclosed language based tractable class, which is maximal as a tractable binary constraint language. Our theory also explains the tractability of the constraint representation of the Stable Marriage Problem which has not been amenable to existing explanations of tractability. In fact we provide a uniform explanation for the tractability of the class of maxclosed CSPs and the SMP. there has been much work done on so called renamable HORN theories which are a tractable subproblem of SAT. It has been shown that renamable HORN theories are tractably identifiable and

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Global constraints for lexicographic orderings 8th

引用

8th international conference on principles and practice of constraint programming, CP 2002

作者： Frisch, Alan Hnich, Brahim Kiziltan, Zeynep Miguel, Ian Walsh, Toby Department of Computer Science University of York Heslington York United Kingdom Computer Science Division Department of Information Science Uppsala University Uppsala Sweden Cork Constraint Computation Center University College Cork Ireland

ISBN: (纸本)3540441204

We propose some global constraints for lexicographic orderings on vectors of variables. these constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision *** show that decomposing such constraints carries a penalty either in the amount or the cost of constraint propagation. We therefore present a global consistency algorithm which enforces a lexicographic ordering between two vectors of n variables in O(nb) time, where b is the cost of adjusting the bounds of a variable. the algorithm can be modified very slightly to enforce a strict lexicographic ordering. Our experimental results on a number of domains (balanced incomplete block design, social golfer, and sports tournament scheduling) confirm the efficiency and value of these new global constraints. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Sports

来源：评论

学校读者我要写书评

暂无评论

Breaking row and column symmetries in matrix models 8th

引用

8th international conference on principles and practice of constraint programming, CP 2002

作者： Flener, Pierre Frisch, Alan M. Hnich, Brahim Kiziltan, Zeynep Miguel, Ian Pearson, Justin Walsh, Toby Dept of Information Tech Uppsala University Box 337 Uppsala751 05 Sweden Department of Computer Science University of York YorkYO10 5DD United Kingdom Dept of Information Science Uppsala University Box 513 Uppsala751 20 Sweden Cork Constraint Computation Centre University College Cork Cork Ireland

ISBN: (纸本)3540441204

We identify an important class of symmetries in constraint programming, arising from matrices of decision variables where rows and columns can be swapped. Whilst lexicographically ordering the rows(columns) breaks all the row (column) symmetries, lexicographically ordering both the rows and the columns fails to break all the compositions of the row and column symmetries. Nevertheless, our experimental results show that this is effective at dealing with these compositions of symmetries. We extend these results to cope with symmetries in any number of dimensions, with partial symmetries, and with symmetric values. Finally, we identify special cases where all compositions of the row and column symmetries can be eliminated by the addition of only a linear number of symmetry-breaking constraints. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Latency-Aware 2-Opt Monotonic Local Search for Distributed constraint Optimization 30

Latency-Aware 2-Opt Monotonic Local Search for Distributed C...

引用

30th international conference on principles and practice of constraint programming, CP 2024

作者： Rachmut, Ben Zivan, Roie Yeoh, William Ben-Gurion University of the Negev Beersheba Israel Washington University St. LouisMO United States

ISBN: (纸本)9783959773362

Researchers recently extended Distributed constraint Optimization Problems (DCOPs) to Communication-Aware DCOPs so that they are applicable in scenarios in which messages can be arbitrarily delayed. Distributed asynchronous local search and inference algorithms designed for CA-DCOPs are less vulnerable to message latency than their counterparts for regular DCOPs. However, unlike local search algorithms for (regular) DCOPs that converge to k-opt solutions (with k > 1), that is, they converge to solutions that cannot be improved by a group of k agents), local search CA-DCOP algorithms are limited to 1-opt solutions only. In this paper, we introduce Latency-Aware Monotonic Distributed Local Search-2 (LAMDLS-2), where agents form pairs and coordinate bilateral assignment replacements. LAMDLS-2 is monotonic, converges to a 2-opt solution, and is also robust to message latency, making it suitable for CA-DCOPs. Our results indicate that LAMDLS-2 converges faster than MGM-2, a benchmark algorithm, to a similar 2-opt solution, in various message latency scenarios. © Ben Rachmut, Roie Zivan, and William Yeoh.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics 30

Strengthening Relaxed Decision Diagrams for Maximum Independ...

引用

30th international conference on principles and practice of constraint programming, CP 2024

作者： Nafar, Mohsen Römer, Michael Bielefeld University Germany

ISBN: (纸本)9783959773362

Finding high-quality bounds is key to devising efficient exact solution approaches for Discrete Optimization (DO) problems. To this end, Decision Diagrams (DDs) provide strong and generic bounding mechanisms. this paper focuses on so-called relaxed DDs which, by merging nodes, over-approximate the solution space of DO problems and provide dual bounds the quality of which hinges upon the ordering of the variables in the DD compilation and on the selection of the nodes to merge. Addressing the Maximum Independent Set Problem, we present a novel dynamic variable ordering strategy relying on induced subgraphs of the original graph, and a new tie-based merge heuristic. In a set of computational experiments, we show that our strategies yield much stronger bounds than the standard state-of-the-art approaches. Furthermore, implementing our heuristics in a DD-based branch-and-bound, we reduce the solution times by around 33 % on average and by more than 50 % on hard instances. © Mohsen Nafar and Michael Römer.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：