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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Breaking all value symmetries in surjection problems

引用

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

作者： Puget, Jean-François ILOG 9 avenue de Verdun 94253 Gentilly France

ISBN: (纸本)3540292381

We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear number of binary constraints. the set of constraints is automatically computed from the symmetries of the problem using computational group theory. Our method applies to problems where every value is taken by at least one variable. Such problems occur frequently in practice. Various experiments show that our method is extremely effective when compared to previously published methods. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Groups and constraints: Symmetry breaking during search 8th

引用

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

作者： Gent, Ian P. Harvey, Warwick Kelsey, Tom School of Computer Science University of St Andrews St Andrews FifeKY16 9SS United Kingdom IC-Parc Imperial College Exhibition Road LondonSW7 2AZ United Kingdom

ISBN: (纸本)3540441204

We present an interface between the ECLiPSe constraint logic programming system and the GAP computational abstract algebra system. the interface provides a method for efficiently dealing with large numbers of symmetries of constraint satisfaction problems for minimal programming effort. We also report an implementation of SBDS using the GAP-ECLiPSe interface which is capable of handling many more symmetries than previous implementations and provides improved search performance for symmetric constraint satisfaction problems. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

cpBPV: a constraint-programming framework for bounded program verification

引用

14th international conference on principles and practice of constraint programming (cp 2008)

作者： Collavizza, Helene Rueher, Michel Van Hentenryck, Pascal Univ Nice Sophia Antipolis CNRS I3S F-06903 Sophia Antipolis France Brown Univ Providence RI 02912 USA

ISBN: (纸本)3540859578

this paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification (cpBPV). the cpBPV framework uses constraint stores to represent both the specification and the program and explores execution paths of bounded length nondeterministically. the cpBPV framework detects non-conformities and provides counter examples when a path of bounded length that refutes some properties exists. the input program is partially correct under the boundness restrictions, if each constraint store so produced implies the post-condition. cpBPV does not explore spurious execution paths, as it incrementally prunes execution paths early by detecting that the constraint store is not consistent. cpBPV uses the rich language of constraint programming to express the constraint store. Finally, cpBPV is parameterized with a list of solvers which are tried in sequence, starting with the least expensive and less general. Experimental results often produce orders of magnitude improvements over earlier approaches, running times being often independent of the size of the variable domains. Moreover, cpBPV was able to detect subtle errors in some programs for which other frameworks based on bounded model checking have failed.

关键词： Bounded program verification constraint-based symbolic execution Detection of nonconformities Test cases generation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Large Neighboring Search Schema for Multi-agent Optimization 1

引用

24th international conference on the principles and practice of constraint programming (cp)

作者： Hoang, Khoi D. Fioretto, Ferdinando Yeoh, William Pontelli, Enrico Zivan, Roie Washington Univ St Louis MO 63110 USA Univ Michigan Ann Arbor MI 48109 USA New Mexico State Univ Las Cruces NM 88003 USA Ben Gurion Univ Negev Beer Sheva Israel

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

the Distributed constraint Optimization Problem (DCOP) is an elegant paradigm for modeling and solving multi-agent problems which are distributed in nature, and where agents cooperate to optimize a global objective within the confines of localized communication. Since solving DCOPs optimally is NP-hard, recent effort in the development of DCOP algorithms has focused on incomplete methods. Unfortunately, many of such proposals do not provide quality guarantees or provide a loose quality assessment. thus, this paper proposes the Distributed Large Neighborhood Search (DLNS), a novel iterative local search framework to solve DCOPs, which provides guarantees on solution quality refining lower and upper bounds in an iterative process. Our experimental analysis of DCOP benchmarks on several important classes of graphs illustrates the effectiveness of DLNS in finding good solutions and tight upper bounds in both problems with and without hard constraints.

关键词： Multiagent Systems Distributed constraint Optimization Large Neighborhood Search

来源：评论

学校读者我要写书评

暂无评论

constraint programming next challenge: Simplicity of use

引用

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

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

ISBN: (纸本)3540232419

constraint programming (cp) is a healthy research area in the academic community. the growing number of participants to the cp conference series, as well as the number of workshops around cp is a good evidence of it. Many major conferences have a cp track, both in artificial intelligence, and in operations research. the existence of several commercial companies that offer cp tools and services is a further evidence of the value of cp as an industrial technology. ILOG is one of such companies. One of our uniqueness, as far as cp is concerned, is that the research and development team that produces our cp products is also responsible for the development of our mathematical programming (MP) tool, namely ILOG cpLEX. this provides a unique opportunity to contrast the way these products are developed, marketed and used. In this paper we argue that current cp technology is much too complex to use for the average engineer. Worse, we believe that much of the research occurring in the cp academic community makes this even worse every year. the rest of the paper provides evidence for this claim, and suggests ways to address the issue of simplicity of use by looking at how a similar issue has been addressed in the mathematical programming community.

关键词：

来源：评论

学校读者我要写书评

暂无评论

constraint-based problem decomposition for a key configuration problem 4th

引用

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

作者： Junker, Ulrich ILOG 9 rue de Verdun BP 85 Gentilly CedexF-94253 France

ISBN: (纸本)3540652248

Finding good problem decompositions is crucial for solving large-scale key/lock configuration problems. We present a novel approach to problem decomposition where the detection of a subproblem hierarchy is formulated as a constraint satisfaction problem (CSP) on set variables. Primitive constraints on set variables such as an inverse and a union-over- set-constraint are used to formalize properties of trees and to ensure that solutions of these CSPs represent a tree. An objective for optimizing properties of the tree is presented as well. Experimental results from an industrial prototype are reported. © Springer-Verlag Berlin Heidelberg 1998.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Exploiting multidirectionality in coarse-grained arc consistency algorithms

引用

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

作者： Lecoutre, Christophe Boussemart, Frédéric Hemery, Fred CNRS FRE 2499 Rue de l’université SP 16 Lens cedex62307 France

ISBN: (纸本)3540202021

Arc consistency plays a central role in solving constraint Satisfaction Problems. this is the reason why many algorithms have been proposed to establish it. Recently, an algorithm called AC2001 and AC3.1 has been independently presented by their authors. this algorithm which is considered as a refinement of the basic algorithm AC3 has the advantage of being simple and competitive. However, it does not take into account constraint bidirectionality as AC7 does. In this paper, we address this issue, and, in particular, introduce two new algorithms called AC3.2 and AC3.3 which benefit from good properties of both AC3 and AC7. Indeed, AC3.2 and AC3.3 are as easy to implement as AC3 and take advantage of bidirectionality as AC7 does. More precisely, AC3.2 is a general algorithm which partially exploits bidirectionality whereas AC3.3 is a binary algorithm which fully exploits bidirectionality. It turns out that, when Maintaining Arc Consistency during search, MAC3.2, due to a memorization effect, is more efficient than MAC3.3 both in terms of constraint checks and cpu time. Compared to MAC2001/3.1, our experimental results show that MAC3.2 saves about 50% of constraint checks and, on average, 15% of cpu time. © Springer-Verlag Berlin Heidelberg 2003.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Testing continuous double auctions with a constraint-based oracle

Testing continuous double auctions with a constraint-based o...

引用

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

作者： Castañeda Lozano, Roberto Schulte, Christian Wahlberg, Lars KTH - Royal Institute of Technology Sweden Cinnober Financial Technology AB Stockholm Sweden

Computer trading systems are essential for today9;s financial markets where the trading systems9; correctness is of paramount economical significance. Automated random testing is a useful technique to find bugs ... 详细信息

ISBN: (纸本)364215395X

Computer trading systems are essential for today's financial markets where the trading systems' correctness is of paramount economical significance. Automated random testing is a useful technique to find bugs in these systems, but it requires an independent system to decide the correctness of the system under test (known as oracle problem). this paper introduces a constraint-based oracle for random testing of a real-world trading system. the oracle provides the expected results by generating and solving constraint models of the trading system's continuous double auction. constraint programming is essential for the correctness of the test oracle as the logic for calculating trades can be mapped directly to constraint models. the paper shows that the generated constraint models can be solved efficiently. Most importantly, the approach is shown to be successful by finding errors in a deployed financial trading system and in its specification. © 2010 Springer-Verlag.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：