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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

52 篇 会议
6 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

54 篇 工学
- 54 篇 计算机科学与技术...
- 36 篇 软件工程
- 1 篇 信息与通信工程
14 篇 理学
- 12 篇 数学
- 5 篇 系统科学
- 1 篇 物理学
1 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...

主题

10 篇 constraint theor...
6 篇 constraint progr...
5 篇 constraint satis...
3 篇 constrained opti...
3 篇 optimization
3 篇 mathematical log...
3 篇 programming tech...
3 篇 programming lang...
3 篇 artificial intel...
3 篇 logics and meani...
2 篇 numerical max-cs...
2 篇 software enginee...
2 篇 global constrain...
2 篇 problem solving
2 篇 detection of non...
2 篇 branch and prune...
2 篇 constraint satis...
2 篇 generalized arc ...
2 篇 interval analysi...
2 篇 numerical constr...

机构

3 篇 natl univ irelan...
2 篇 univ nice sophia...
2 篇 univ nantes lab ...
2 篇 inria irisa renn...
2 篇 univ nantes lina...
2 篇 natl univ singap...
2 篇 cnrs lab informa...
2 篇 univ barcelona e...
2 篇 chinese univ hon...
2 篇 brown univ provi...
2 篇 univ nantes cnrs...
1 篇 inra toulouse
1 篇 univ lisbon inst...
1 篇 univ bologna dei...
1 篇 zuse institute b...
1 篇 brown university...
1 篇 univ lille nord ...
1 篇 australian natl ...
1 篇 epfl ch-1015
1 篇 hacettepe univ d...

作者

9 篇 o'sullivan barry
4 篇 goldsztejn alexa...
3 篇 van hentenryck p...
3 篇 yap roland h. c.
3 篇 cheng kenil c. k...
2 篇 normand jean-mar...
2 篇 hadzic tarik
2 篇 rueher michel
2 篇 collavizza helen...
2 篇 beldiceanu nicol...
2 篇 granvilliers lau...
2 篇 beck j. christop...
2 篇 benhamou frederi...
2 篇 christie marc
2 篇 milano michela
1 篇 pearson justin
1 篇 botea adi
1 篇 prestwich steven...
1 篇 prestwich steven
1 篇 kitching matthew

语言

61 篇 英文
2 篇 中文

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

共 63 条记录，以下是11-20 订阅

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

详细简洁

排序：

Connecting ABT with Arc Consistency

引用

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

作者： Brito, Ismel Meseguer, Pedro CSIC IIIA Bellaterra 09193 Spain

ISBN: (纸本)9783540859574

ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogoods has an empty left-hand side, the considered value is eliminated unconditionally, once and for all. this value deletion can be propagated using standard arc consistency techniques, producing new deletions in the domains of other variables. this causes substantial reductions in the search effort required to solve a class of problems. We also extend this idea to the propagation of conditional deletions. something already proposed in the past. We provide experimental results that show the benefits of the proposed approach, especially considering communication cost.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Computing All Optimal Solutions in Satisfiability Problems with Preferences

引用

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

作者： Di Rosa, Emanuele Giunchiglia, Enrico Maratea, Marco Univ Genoa DIST I-16145 Genoa Italy

ISBN: (纸本)9783540859574

the problem of finding an optimal solution in a constraint satisfaction problem with preferences has attracted a lot of researchers in Artificial Intelligence in general, and in the constraint programming community in particular. As a consequence, several approaches for expressing and reasoning about satisfiability problems with preferences have been proposed, and viable solutions exist for finding one optimal Solution. However, in many cases, it is not desirable to find just one solution. Indeed, it might be desirable to he able to compute more, and possibly all, optimal solutions, e.g.. for comparatively evaluate them on the basis of other criteria not captured by the preferences. In this paper we present a procedure for computing all optimal solutions of a satisfiability problem with preferences. the procedure is guaranteed to compute all and only the optimal solutions, i.e., models which are not optimal are not even computed.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Solving a Telecommunications Feature Subscription Configuration Problem

引用

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

作者： Lesaint, David Mehta, Deepak O'Sullivan, Barry Quesada, Luis Wilson, Nic Intelligent Systems Research Centre British Telecom United Kingdom Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783540859574

Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. the configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation. In this paper, we show that this problem is NP-hard and we present a constraint programming formulation using the variable weighted constraint satisfaction problem framework. We also present simple formulations using partial weighted maximum satisfiability and integer linear programming. We experimentally compare our formulations of the different approaches;the results suggest that our constraint programming approach is the best of the three overall.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540859581

ISBN: (纸本)9783540859574

this volume contains the proceedings of the 14th international conference on principles and practice of constraint programming (cp 2008) held in Sydney, Australia, September 14–18, 2008. the conference was held in conjunction with the international conference on Automated Planning and Scheduling (ICAPS 2008) and the international conference on Knowledge Representation and R- soning (KR 2008). Information about the conference can be found at the w- sitehttp://www. unimelb. edu. au/cp2008/. Held annually, the cp conference series is the premier international conference on constraint programming. the conference focuses on all aspects of computing with constraints. the cp conf- ence series is organized by the Association for constraint programming (Acp). Information about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about Acp can be found athttp://www. a4cp. org/. cp 2008 included two calls for contributions: a call for research papers, - scribing novel contributions in the ?eld, and a call for application papers, - scribing applications of constraint technology. For the ?rst time authors could directly submit short papers for consideration by the committee. the research track received 84 long submissions and 21 short submissions and the application track received 15 long submissions. Each paper received at least three reviews, which the authors had the opportunity to see and to react to, before the papers and their reviews were discussed extensively by the members of the Program Committee.

关键词： programming Languages, Compilers, Interpreters programming Techniques Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages Computer Appl. in Administrative Data Processing

来源：评论

学校读者我要写书评

暂无评论

Universal Booleanization of constraint Models

引用

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

作者： Huang, Jinbo Natl ICT Australia Sydney NSW Australia

ISBN: (纸本)9783540859574

While the efficiency and scalability of modern SARI technology offers an intriguing alternative approach to constraint Solving via translation to SAT, previous work has mostly focused of the translation of specific types of constraints, such as pseudo Boolean constraints;finite integer linear constraints, and constraints given as explicit listings of allowed triples. BY contrast, we present a translation of constraint models to SAT at language level, using the recently proposed constraint modeling language MiniZine, such that any satisfaction or optimization problem written in the language (not involving floats) can be automatically Booleanized and solved by one or more calls to a SAT solver. We discuss the strengths and weaknesses of such a universal constraint solver, Mid report oil a large-scale empirical evaluation of it against two existing solvers for MiniZinc: the finite domain solver distributed with MiniZinc and one based on the Gecode constraint;programming platform. our results indicate that, Booleanization indeed offers a competitive alternative, exhibiting superior performance on some classes of problems involving large numbers of constraints and complex integer arithmetic, ill addition to, naturally, problems dial arc already largely Boolean.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

A Framework for Hybrid Tractability Results in Boolean Weighted constraint Satisfaction Problems

引用

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

作者： Kumar, T. K. Satish Inst Human & Machine Cognit Pensacola FL USA

ISBN: (纸本)9783540859574

Many tasks in automated reasoning can be modeled as weighted constraint satisfaction problems over Boolean variables (Boolean WCSPs). Tractable classes of Such problems have traditionally been identified by exploiting either: (a) the topology of the associated constraint network, or (b) the structure of the weighted constraints. In this paper, we introduce the notion of a constraint composite graph (CCG) associated with a given (Boolean) WCSP. the CCG provides it unifying framework for characterizing/exploiting both the graphical structure of the constraint network as well as the structure of the weighted constraints. We show that a given (Boolean) WCSP can be reduced to the problem of computing the minimum weighted vertex cover for its associated CM and we establish the following two important results: ( 1) "the CCG of a given Boolean WCSP has the same treewidth as its associated constraint network," and (2) "many classes of Boolean WCSPs that are tractable by, virtue of the structure of their weighted constraints have associated CCGs that arc bipartite in nature."

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Optimization of Simple Tabular Reduction for Table constraints

引用

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

作者： Lecoutre, Christophe Univ Lille Nord France CRIL CNRS UMR 8188 F-62307 Lens France

ISBN: (纸本)9783540859574

Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to compress their representation. We show that simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of Supports, is very often the most efficient practical approach to enforce generalized arc consistency within MAC. We also describe an optimization of STR which allows limiting the number of operations related to validity checking or search of supports. Interestingly enough, this optimization makes STIR potentially r times faster where r is the arity of the constraint(s). the results of an extensive experimentation that we have conducted with respect to random and structured instances indicate that the optimized algorithm we propose is usually around twice as fast its the original STR and can be up to one order of magnitude faster than previous state-of-the-art algorithms on some series of instances.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A Soft constraint of Equality: Complexity and Approximability

引用

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

作者： Hebrard, Emmanuel O'Sullivan, Barry Razgon, Igor Natl Univ Ireland Univ Coll Cork Dept Comp Sci Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783540859574

We introduce the SOFTALLEQUAL global constraint. which maximizes the number of equalities holding between hairs of assignments to a set of variables. MO study the computational complexity of propagating this constraint, showing that it is intractable in general. Since maximizing the number of pairs of equally assigned variables ill a set is NP-hard. We propose three: ways of coping with NP-hardness Firstly, we develop a greedy linear-time algorithm to approximate the maximum number of equalities within a factor on. Secondly. we identify a tractable (polynomial) class for this constraint. thirdly;we identify a parameter based oil this class and show that the SOFTALLEQUAL constraint is fixed-parameter tractable with respect to this parameter.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate Compilation of constraints into Multivalued Decision Diagrams

引用

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

作者： Hadzic, Tarik Hooker, John N. O'Sullivan, Barry Tiedemann, Peter Cork Constraint Computat Ctr Cork Ireland Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Copenhagen DK-1168 Copenhagen Denmark

ISBN: (纸本)9783540859574

We present tin incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). the algorithm uses a vertex splitting operation that relies on the detection of equivalent paths in the MDD. Although the algorithm is quite general, it can be adapted to exploit constraint structure by specializing the equivalence tests for partial assignments to particular constraints. We show how to modify the algorithm in a principled way to obtain an approximate MDD when the exact MDD is too large for practical purposes. this is done by replacing the equivalence test with a constraint-specific measure of distance. We demonstrate the value of the approach for approximate and exact MDD compilation and evaluate its benefits in one of the main MDD application domains, interactive configuration.

关键词： Many valued logics

来源：评论

学校读者我要写书评

暂无评论

Search Space Reduction for constraint Optimization Problems

引用

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

作者： Cheng, Kenil C. K. Yap, Roland H. C. Natl Univ Singapore Sch Computing Singapore Singapore

ISBN: (纸本)9783540859574

In a constraint optimization problem (COP), many feasible assignment's have the same objective value. this usually means huge search space and poor propagation among the objective variables (which appear in the objective function) and the problem variables (which do not). In this paper, we investigate a. search strategy that focuses oil the objective function, namely, the objective variables are assigned before the problem variables Despite the larger search space;we may indeed solve a COP faster, provided that the constraint propagation is strong - the search can reach the optimal objective value faster in the objective space, and by strong propagation it knows if the constraints are unsatisfiable with little search ill tile problem space. To obtain strong propagation we study the use of dual encoding [1] for COP's. Our COP formulation and search strategy are general and can handle any dual COPS.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：