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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

68 篇 会议
4 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

66 篇 工学
- 64 篇 计算机科学与技术...
- 52 篇 软件工程
- 1 篇 动力工程及工程热...
- 1 篇 信息与通信工程
- 1 篇 环境科学与工程（可...
17 篇 理学
- 14 篇 系统科学
- 9 篇 数学
- 1 篇 统计学（可授理学、...
3 篇 管理学
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...

主题

18 篇 constraint theor...
10 篇 constraint satis...
3 篇 mathematical log...
3 篇 programming tech...
3 篇 programming lang...
3 篇 constraint progr...
3 篇 logics and meani...
3 篇 regular constrai...
2 篇 solution countin...
2 篇 model-driven vis...
2 篇 problem solving
2 篇 modeling languag...
2 篇 alldifferent con...
2 篇 constraint optim...
2 篇 semantics
2 篇 constraint-based...
2 篇 optimization alg...
2 篇 heuristic search
1 篇 traveling salesm...
1 篇 genetic programm...

机构

4 篇 natl univ irelan...
4 篇 kth royal inst t...
3 篇 univ connecticut...
3 篇 brown univ provi...
2 篇 univ bologna dei...
2 篇 univ cote azur c...
2 篇 nicta nsw
2 篇 ecole polytech m...
2 篇 univ nottingham ...
2 篇 intel corp haifa
2 篇 univ coll cork c...
2 篇 cornell univ dep...
2 篇 ecole polytech d...
2 篇 univ oxford comp...
2 篇 brown univ dept ...
2 篇 natl univ irelan...
1 篇 inra toulouse
1 篇 university of ne...
1 篇 ecole polytech f...
1 篇 cnrs fre 2499 ru...

作者

5 篇 stuckey peter j.
5 篇 o'sullivan barry
4 篇 van hentenryck p...
4 篇 bessiere christi...
4 篇 hebrard emmanuel
4 篇 lecoutre christo...
4 篇 schulte christia...
4 篇 pesant gilles
3 篇 zanarini alessan...
3 篇 michel laurent
3 篇 milano michela
2 篇 prestwich steven
2 篇 miguel ian
2 篇 hnich brahim
2 篇 tarim s. armagan
2 篇 gent ian p.
2 篇 rossi roberto
2 篇 beldiceanu nicol...
2 篇 lombardi michele
2 篇 meseguer pedro

语言

75 篇 英文

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

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Global Inverse Consistency for Interactive constraint Satisfaction

Global Inverse Consistency for Interactive Constraint Satisf...

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Bessiere, Christian Fargier, Helene Lecoutre, Christophe Univ Montpellier LIRMM CNRS Montpellier France Univ Toulouse CNRS IRIT Toulouse France Univ Artois CNRS CRIL Lens France

ISBN: (纸本)9783642406263;9783642406270

Some applications require the interactive resolution of a constraint problem by a human user. In such cases, it is highly desirable that the person who interactively solves the problem is not given the choice to select values that do not lead to solutions. We call this property global inverse consistency. Existing systems simulate this either by maintaining arc consistency after each assignment performed by the user or by compiling offline the problem as a multi-valued decision diagram. In this paper, we define several questions related to global inverse consistency and analyse their complexity. Despite their theoretical intractability, we propose several algorithms for enforcing global inverse consistency and we show that the best version is efficient enough to be used in an interactive setting on several configuration and design problems. We finally extend our contribution to the inverse consistency of tuples.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Quantified constraint satisfaction and 2-semilattice polymorphisms

引用

10th international conference on the principles and practice of constraint programming

作者： Chen, HB Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)3540232419

the quantified constraint satisfaction problem (QCSP) is a natural and useful generalization of the constraint satisfaction problem (CSP) in which both universal and existential quantification of variables is permitted. Because the CSP and QCSP are in general intractable, much effort has been directed towards identifying restricted cases of these problems that are tractable in polynomial time. In this paper, we investigate restricted cases of the QCSP having 2-semilattice polymorphisms. We prove a complete classification of 2-semilattice polymorphisms, demonstrating that each gives rise to a case of the QCSP that is either tractable in polynomial time, or coNP-hard.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A Geometric constraint over k-Dimensional Objects and Shapes Subject to Business Rules

引用

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

作者： Carlsson, Mats Beldiceanu, Nicolas Martin, Julien SICS POB 1263 SE-16429 Kista Sweden LINA UMR CNRS 6241 Ecole Mines Nantes F-44307 Nantes France INRIA Rocquencourt Le Chesnay France

ISBN: (纸本)9783540859574

this paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rules are rewritten to Quantifier-Free Presburger Arithmetic (QFPA) formulas. Secondly. such formulas arc compiled to generators of k-dimensional forbidden sets. Such generators are a generalization of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are aggregated by a sweep-based algorithm and used for filtering. the business rules allow to express a great variety of packing and placement constraints, while admitting effective filtering of the domain variables of the k-dimensional object, without the need to use spatial data structures.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Sequential Precede Chain for Value Symmetry Elimination 1

引用

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

作者： Gange, Graeme Stuckey, Peter J. Monash Univ Fac Informat Technol Melbourne Vic Australia CSIRO Data61 Melbourne Vic Australia

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

the main global constraint used for removing value symmetries is the VALUE-PRECEDE-CHAIN constraint which forces the first occurences of values in an ordered list to be appear in order. We introduce the SEQ-PRECEDE-CHAIN constraint for the restricted, but common, case where the values are 1, 2, ... , k, and variables in the constraint do not take values higher than k. We construct an efficient domain consistent propagator for this constraint, and show how we can generate explanations for its propagation. this leads us to an efficient domain consistent decomposition. We show how we can map any VALUE-PRECEDE-CHAIN to use instead SEQ-PRECEDE-CHAIN. Experiments show that the new propagator and decomposition are better than existing approachs to propagating VALUE-PRECEDE-CHAIN.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A generic geometrical constraint kernel in space and time for handling polymorphic κ-dimensional objects

A generic geometrical constraint kernel in space and time fo...

引用

13th international conference on principles and practice of constraint programming (cp 2007)

作者： Beldiceanu, N. Carlsson, M. Poder, E. Sadek, R. Truchet, C. CNRS LINA FRE 2729 Ecole Mines Nantes FR-44307 Nantes France SICS SE-16429 Kista Sweden Univ Nantes CNRS LINA FRE 2729 FR-44322 Nantes France

ISBN: (纸本)9783540749691

this paper introduces a geometrical constraint kernel for handling the location in space and time of polymorphic kappa-dimensional objects subject to various geometrical and time constraints. the constraint kernel is generic in the sense that one of its parameters is a set of constraints on subsets of the objects. these constraints are handled globally by the kernel. We first illustrate how to model several placement problems with the constraint kernel. We then explain how new constraints can be introduced and plugged into the kernel. Based on these interfaces, we develop a generic k-dimensional lexicographic sweep algorithm for filtering the attributes of an object (i.e., its shape and the coordinates of its origin as well as its start, duration and end in time) according to all constraints where the object occurs. Experiments involving up to hundreds of thousands of objects and 1 million integer variables are provided in 2, 3 and 4 dimensions, both for simple shapes (i.e., rectangles, parallelepipeds) and for more complex shapes.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Solution counting algorithms for constraint-centered search heuristics

Solution counting algorithms for constraint-centered search ...

引用

13th international conference on principles and practice of constraint programming (cp 2007)

作者： Zanarini, Alessandro Pesant, Gilles Ecole Polytech Dept Comp & Software Engn Montreal PQ H3C 3A7 Canada

ISBN: (纸本)3540749691

constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. this paper intends to do the same thing for search, proposing constraint-centered heuristics which guide the exploration of the search space toward areas that are likely to contain a high number of solutions. We first propose new search heuristics based on solution counting information at the level of individual constraints. We then describe efficient algorithms to evaluate the number of solutions of two important families of constraints: occurrence counting constraints, such as all different, and sequencing constraints, such as regular. In both cases we take advantage of existing filtering algorithms to speed up the evaluation. Experimental results on benchmark problems show the effectiveness of our approach.

关键词： Solution counting Heuristic search Regular constraint Alldifferent constraint

来源：评论

学校读者我要写书评

暂无评论

Maintaining Soft Arc Consistencies in BnB-ADOPT⁺ during Search

Maintaining Soft Arc Consistencies in BnB-ADOPT<SUP>+</SUP> ...

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Gutierrez, Patricia Lee, Jimmy H. M. Lei, Ka Man Mak, Terrence W. K. Meseguer, Pedro Univ Autonoma Barcelona IIIA CSIC Bellaterra 08193 Spain Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Peoples R China NICTA Victoria Lab Melbourne Vic 3010 Australia Univ Melbourne Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

Gutierrez and Meseguer show how to enforce consistency in BnB-ADOPT(+) for distributed constraint optimization, but they consider unconditional deletions only. However, during search, more values can be pruned conditionally according to variable instantiations that define subproblems. Enforcing consistency in these subproblems can cause further search space reduction. We introduce efficient methods to maintain soft arc consistencies in every subproblem during search, a non trivial task due to asynchronicity and induced overheads. Experimental results show substantial benefits on three different benchmarks.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for mining frequent sequence with constraint programming 15th

引用

15th European conference on Machine Learning and principles and practice of Knowledge Discovery in Databases, ECML PKDD 2016

作者： Aoga, John O. R. Guns, Tias Schaus, Pierre UCLouvain ICTEAM Louvain-la-Neuve Belgium DTAI Research Group KU Leuven Leuven Belgium

ISBN: (纸本)9783319462264

the main advantage of constraint programming (cp) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular expressions, length restrictions, etc.). the current best cp approach for SPM uses a global constraint (module) that computes the projected database and enforces the minimum frequency;it does this with a filtering algorithm similar to the PrefixSpan method. However, the resulting system is not as scalable as some of the most advanced mining systems like Zaki’s cSPADE. We show how, using techniques from both data mining and cp, one can use a generic constraint solver and yet outperform existing specialized systems. this is mainly due to two improvements in the module that computes the projected frequencies: first, computing the projected database can be sped up by pre-computing the positions at which a symbol can become unsupported by a sequence, thereby avoiding to scan the full sequence each time;and second by taking inspiration from the trailing used in cp solvers to devise a backtracking-aware data structure that allows fast incremental storing and restoring of the projected database. Detailed experiments show how this approach outperforms existing cp as well as specialized systems for SPM, and that the gain in efficiency translates directly into increased efficiency for other settings such as mining with regular expressions. the data and software related to this paper are available at http://***/cp4dm/ spm/. © Springer international Publishing AG 2016.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Finding Solutions by Finding Inconsistencies 1

引用

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

作者： Ziat, Ghiles Pelleau, Marie Truchet, Charlotte Mine, Antoine Sorbonne Univ CNRS Lab Informat Paris 6 LIP6 F-75005 Paris France Univ Cote Azur CNRS I3S Nice France Univ Nantes TASC LS2N UMR 6004 Nantes France

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

In continuous constraint programming, the solving process alternates propagation steps, which reduce the search space according to the constraints, and branching steps. In practice, the solvers spend a lot of computation time in propagation to separate feasible and infeasible parts of the search space. the constraint propagators cut the search space into two subspaces: the inconsistent one, which can be discarded, and the consistent one, which may contain solutions and where the search continues. the status of all this consistent subspace is thus indeterminate. In this article, we introduce a new step called elimination. It refines the analysis of the consistent subspace by dividing it into an indeterminate one, where the search must continue, and a satisfied one, where the constraints are always satisfied. the latter can be stored and removed from the search process. Elimination relies on the propagation of the negation of the constraints, and a new difference operator to efficiently compute the obtained set as an union of boxes, thus it uses the same representations and algorithms as those already existing in the solvers. Combined with propagation, elimination allows the solver to focus on the frontiers of the constraints, which is the core difficult part of the problem. We have implemented our method in the AbSolute solver, and present experimental results on classic benchmarks with good performances.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：