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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

36 篇 会议
2 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

27 篇 理学
- 21 篇 数学
- 18 篇 系统科学
- 1 篇 统计学（可授理学、...
25 篇 工学
- 24 篇 计算机科学与技术...
- 16 篇 软件工程
- 2 篇 信息与通信工程
- 1 篇 电气工程
- 1 篇 农业工程
1 篇 法学
- 1 篇 社会学
1 篇 农学
- 1 篇 作物学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

11 篇 constraint satis...
10 篇 constraint theor...
2 篇 directed graphs
1 篇 hierarchical sys...
1 篇 constraint gener...
1 篇 weighted clones
1 篇 motion planning
1 篇 least core
1 篇 discrete optimiz...
1 篇 soft neighborhoo...
1 篇 constrained opti...
1 篇 constraint handl...
1 篇 logic programmin...
1 篇 weighted constra...
1 篇 mathematical log...
1 篇 propagator
1 篇 tsp
1 篇 global constrain...
1 篇 constraint satis...
1 篇 program testing

机构

2 篇 cork constraint ...
2 篇 mines de nantes
2 篇 chinese univ hon...
2 篇 cork constraint ...
1 篇 computer and aut...
1 篇 univ autonoma ba...
1 篇 microsoft resear...
1 篇 i3s umr 6070 cnr...
1 篇 algorithms and c...
1 篇 sics kista 16429
1 篇 irit university ...
1 篇 department of co...
1 篇 univ paris est f...
1 篇 lausanne ch-1015
1 篇 ryerson univ dep...
1 篇 nicta university...
1 篇 natl inst inform...
1 篇 national institu...
1 篇 univ wyoming dep...
1 篇 cnrs inria tasc ...

作者

4 篇 beldiceanu nicol...
3 篇 pearson justin
3 篇 flener pierre
3 篇 o'sullivan barry
2 篇 jackson marcel
2 篇 niven todd
2 篇 lee jimmy h. m.
2 篇 petit thierry
2 篇 yokoo makoto
2 篇 iwasaki atsushi
1 篇 prestwich steven...
1 篇 isoart nicolas
1 篇 mears christophe...
1 篇 cadar cristian
1 篇 he jun
1 篇 vilím petr
1 篇 cooper martin
1 篇 wallace mark
1 篇 zhang wei ming
1 篇 wilson nic

语言

39 篇 英文

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

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

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

详细简洁

排序：

Solving String constraints: the Case for constraint programming

Solving String Constraints: The Case for Constraint Programm...

引用

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

作者： He, Jun Flener, Pierre Pearson, Justin Zhang, Wei Ming Uppsala Univ Dept Informat Technol Uppsala Sweden Natl Univ Def Technol Sch Informat Syst & Management Changsha Hunan Peoples R China

ISBN: (纸本)9783642406263;9783642406270

We improve an existing propagator for the context-free grammar constraint and demonstrate experimentally the practicality of the resulting propagator. the underlying technique could be applied to other existing propagators for this constraint. We argue that constraint programming solvers are more suitable than existing solvers for verification tools that have to solve string constraints, as they have a rich tradition of constraints for membership in formal languages.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Encodings of the SEQUENCE constraint

Encodings of the SEQUENCE constraint

引用

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

作者： Brand, Sebastian Narodytska, Nina Quimper, Claude-Guy Stuckey, Peter Walsh, Toby NICTA University of Melbourne NICTA University of NSW Omega Optimisation

ISBN: (纸本)9783540749691

the SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constraint, some of which do not hinder propagation. We prove that, down a branch of a search tree, domain consistency can be enforced on the SEQUENCE constraint in just O(n(2) log n) time. this improves upon the previous bound of O(n(3)) for each call down the tree. We also consider a generalization of the SEQUENCE constraint - the Multiple SEQUENCE constraint. Our experiments suggest that, on very large and tight problems, domain consistency algorithms are best. However, on smaller or looser problems, much simpler encodings are better, even though these encodings hinder propagation. When there are multiple SEQUENCE constraints, a more expensive propagator shows promise.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Integration of Structural constraints into TSP Models 25th

Integration of Structural Constraints into TSP Models

引用

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

作者： Isoart, Nicolas Regin, Jean-Charles Univ Cote Azur CNRS I3S Sophia Antipolis France

ISBN: (纸本)9783030300487

Several models based on constraint programming have been proposed to solve the traveling salesman problem (TSP). the most efficient ones, such as the weighted circuit constraint (WCC), mainly rely on the Lagrangian relaxation of the TSP, based on the search for spanning tree or more precisely "1-tree". the weakness of these approaches is that they do not include enough structural constraints and are based almost exclusively on edge costs. the purpose of this paper is to correct this drawback by introducing the Hamiltonian cycle constraint associated with propagators. We propose some properties preventing the existence of a Hamiltonian cycle in a graph or, conversely, properties requiring that certain edges be in the TSP solution set. Notably, we design a propagator based on the research of k-cutsets. the combination of this constraint with the WCC constraint allows us to obtain, for the resolution of the TSP, gains of an order of magnitude for the number of backtracks as well as a strong reduction of the computation time.

关键词： Global constraint TSP Propagator

来源：评论

学校读者我要写书评

暂无评论

Solving Intensional Weighted CSPs by Incremental Optimization with BDDs

Solving Intensional Weighted CSPs by Incremental Optimizatio...

引用

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

作者： Bofill, Miquel Palahi, Miquel Suy, Josep Villaret, Mateu Univ Girona Dept Informat Matemat Aplicada & Estat Girona Spain

ISBN: (纸本)9783319104287;9783319104270

We present a method for solving weighted constraint Satisfaction Problems, based on translation into a constraint Optimization Problem and iterative calls to an SMT solver, with successively tighter bounds of the objective function. the novelty of the method herewith described lies in representing the bound constraint as a shared Binary Decision Diagram, which in turn is translated into SAT. this offers two benefits: first, BDDs built for previous bounds can be used to build the BDDs for new (tighter) bounds, considerably reducing the BDD construction time;second, as a by-product, many clauses asserted to the solver in previous iterations can be reused. the reported experimentation on the WSimply system shows that this technique has better performance in general than other methods implemented in the system. Moreover, with the new technique WSimply outperforms some state-of-the-art solvers in most of the studied instances.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Revisiting the tree constraint

Revisiting the tree constraint

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Fages, Jean-Guillaume Lorca, Xavier École des Mines de Nantes INRIA LINA UMR CNRS 6241 Nantes Cedex 3FR-44307 France

ISBN: (纸本)9783642237850

this paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roots. We introduce a new filtering algorithm that enforces generalized arc-consistency in O(n + m) time while the original filtering algorithm reaches O(nm) time. this result allows to tackle larger scale problems involving graph partitioning. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Augmenting Stream constraint programming with Eventuality Conditions 1

引用

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

作者： Lee, Jasper C. H. Lee, Jimmy H. M. Zhong, Allen Z. Brown Univ Dept Comp Sci Providence RI 02912 USA Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

Stream constraint programming is a recent addition to the family of constraint programming frameworks, where variable domains are sets of infinite streams over finite alphabets. Previous works showed promising results for its applicability to real-world planning and control problems. In this paper, motivated by the modelling of planning applications, we improve the expressiveness of the framework by introducing (1) the "until" constraint, a new construct that is adapted from Linear Temporal Logic and (2) the @ operator on streams, a syntactic sugar for which we provide a more efficient solving algorithm over simple desugaring. For both constructs, we propose corresponding novel solving algorithms and prove their correctness. We present competitive experimental results on the Missionaries and Cannibals logic puzzle and a standard path planning application on the grid, by comparing with Apt and Brand's method for verifying eventuality conditions using a cp approach.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A constraint seeker: Finding and ranking global constraints from examples

A constraint seeker: Finding and ranking global constraints ...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Beldiceanu, Nicolas Simonis, Helmut Mines de Nantes France Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)9783642237850

In this paper we describe a constraint Seeker application which provides a web interface to search for global constraints in the global constraint catalog, given positive and negative, fully instantiated (ground) examples. Based on the given instances the tool returns a ranked list of matching constraints, the rank indicating whether the constraint is likely to be the intended constraint of the user. We give some examples of use cases and generated output, describe the different elements of the search and ranking process, discuss the role of constraint programming in the different tools used, and provide evaluation results over the complete global constraint catalog. the constraint Seeker is an example for the use of generic meta-data provided in the catalog to solve a specific problem. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

On the Reduction of the CSP Dichotomy Conjecture to Digraphs

On the Reduction of the CSP Dichotomy Conjecture to Digraphs

引用

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

作者： Bulin, Jakub Delic, Dejan Jackson, Marcel Niven, Todd Charles Univ Prague Fac Math & Phys Prague Czech Republic Ryerson Univ Dept Math Toronto ON Canada La Trobe Univ Dept Math Melbourne Vic Australia

ISBN: (纸本)9783642406263;9783642406270

It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Routefinder: Efficiently finding k shortest paths using constraint programming

Routefinder: Efficiently finding k shortest paths using cons...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： Lefebvre, Michel P. Puget, Jean-François Vilím, Petr IBM 21 chemin de la Sauvegarde Ecully69130 France IBM 350 Avenue de Boulouris Saint Raphael83700 France IBM V Parku 2294/4 Praha 4Chodov148 00 Czech Republic

ISBN: (纸本)9783642237850

In this paper, we describe a constraint programming (cp) route finding application for a container transportation company. Mathematically, this amounts to finding the k shortest paths in a directed graph. However the nature of the business constraints rule out known algorithms such as Dijkstra’s. Indeed, one cannot unfold all constraints into a directed graph as the resulting graph would be too large. Given an origin and destination (two places), the problem is to decide which ships should be used (routes), and when and where the containers should be loaded from one ship to another (connections), while satisfying many business rules specified by the transportation company. the cp model described in this paper is quite simple, it doesn’t use any specialized constraints, but it is surprisingly effective. Queries for the best route are answered in a matter of a second or fraction of a second, although the problem is very large: around 900 places, 2,300 routes, 22,000 connections and 4,200 business rules. the system gracefully handles 100,000 requests a day on a single server. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Filtering algorithms for discrete cumulative problems with overloads of resource

Filtering algorithms for discrete cumulative problems with o...

引用

17th international conference on principles and practice of constraint programming, cp 2011

作者： De Clercq, Alexis Petit, thierry Beldiceanu, Nicolas Jussien, Narendra École des Mines de Nantes LINA UMR CNRS 6241 4 rue Alfred Kastler NantesFR-44307 France

ISBN: (纸本)9783642237850

Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. Moreover, this capacity is not necessarily always the same during the scheduling period. this article introduces a new constraint for solving this class of problems. We adapt two filtering algorithms to our context: Sweep and P. Vilím’s Edge-Finding algorithm. We emphasize that in some problems violations are imposed. We design a new filtering procedure specific to this kind of events. We introduce a search heuristic specific to our constraint. We successfully experiment our constraint. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：