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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

62 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 13 篇 软件工程
- 1 篇 电气工程
- 1 篇 交通运输工程
48 篇 理学
- 44 篇 数学
- 14 篇 系统科学
- 1 篇 统计学（可授理学、...
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

12 篇 constraint satis...
12 篇 constraint theor...
5 篇 computer program...
3 篇 linear programmi...
3 篇 constraint progr...
1 篇 bandit
1 篇 constraint logic...
1 篇 query languages
1 篇 inverse problems
1 篇 large neighborho...
1 篇 problem solving
1 篇 chaotic dynamica...
1 篇 modeling languag...
1 篇 adaptive search
1 篇 concolic testing
1 篇 soft neighborhoo...
1 篇 containers
1 篇 optimal systems
1 篇 redundancy
1 篇 iterative method...

机构

2 篇 cork constraint ...
2 篇 université côte ...
2 篇 univ coll cork c...
2 篇 univ melbourne m...
2 篇 faculty of elect...
1 篇 free univ amster...
1 篇 univ st andrews ...
1 篇 université côte ...
1 篇 univ nantes lina...
1 篇 tech univ catalo...
1 篇 nicta nsw
1 篇 univ melbourne n...
1 篇 antwerp maritime...
1 篇 univ melbourne d...
1 篇 ujf cnrs grenobl...
1 篇 univ york york y...
1 篇 univ artois cnrs...
1 篇 cnrs lirmm f-343...
1 篇 univ autonoma ba...
1 篇 algorithms and c...

作者

5 篇 stuckey peter j.
4 篇 régin jean-charl...
3 篇 pearson justin
3 篇 werner tomáš
3 篇 chu geoffrey
3 篇 dlask tomáš
3 篇 flener pierre
3 篇 o'sullivan barry
2 篇 prestwich steven...
2 篇 thorstensen evge...
2 篇 isoart nicolas
2 篇 miguel ian
2 篇 nightingale pete...
2 篇 gent ian p.
2 篇 de givry simon
2 篇 schaus pierre
1 篇 schoenauer marc
1 篇 prestwich steven
1 篇 fargier helene
1 篇 fontaine daniel

语言

63 篇 英文

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

共 63 条记录，以下是31-40 订阅

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

详细简洁

排序：

Tractable combinations of global constraints

Tractable combinations of global constraints

引用

19th international conference on principles and practice of constraint programming, cp 2013

作者： Cohen, David A. Jeavons, Peter G. thorstensen, Evgenij Živný, Stanislav Department of Computer Science Royal Holloway University of London United Kingdom Department of Computer Science University of Oxford United Kingdom Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9783642406263

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structural restrictions with the observation that some important types of global constraint do not distinguish between large classes of equivalent solutions. © 2013 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Localization of an underwater robot using interval constraint propagation

Localization of an underwater robot using interval constrain...

引用

12th international conference on principles and practice of constraint programming (cp 2006)

作者： Jaulin, Luc ENSIETA F-29806 Brest 09 France GESMA Grp Etud Sous Marine Atlant Brest France

ISBN: (纸本)3540462678

Since electromagnetic waves are strongly attenuated inside the water, the satellite based global positioning system (cpS) cannot be used by submarine robots except at the surface of the water. this paper shows that the localization problem in deep water can often be cast into a continuous constraints satisfaction problem where interval constraints propagation algorithms are particularly efficient. the efficiency of the resulting propagation methods is illustrated on the localization of a submarine robot, named Redermor. the experiments have been collected by the GESMA (Groupe d'Etude Sous-Marine de l'Atlantique) in the Douarnenez bay, in Brittany.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

When constraint programming and Local Search solve the scheduling problem of Electricite de France nuclear power plant outages

When Constraint Programming and Local Search solve the sched...

引用

12th international conference on principles and practice of constraint programming (cp 2006)

作者： Khemmoudj, Mohand Ou Idir Porcheron, Marc Bennaceur, Hachemi CNRS LIPN UMR 7030 F-93430 Villetaneuse France EDF R&D F-92141 Clamart France

ISBN: (纸本)3540462678

the French nuclear park comprises 58 nuclear reactors distributed through the national territory on 19 geographical sites. they must be repeatedly stopped, for refueling and maintenance. the scheduling of these outages has to comply with various constraints, regarding safety, maintenance logistic, and plant operation, whilst it must contribute to the producer profit maximization. this industrial problem appears to be a hard combinatorial problem that conventional methods used up to now by Electricite de France (mainly based on Mixed Integer programming) fail to solve properly. We present in this paper a new approach for modeling and solving this problem, combining constraint programming (cp) and Local Search. cp is used to find solutions to the outage scheduling problem, while Local Search is used to improve solutions with respect to a heuristic cost criterion. It leads to find solutions as good as with the conventional approaches, but taking into account all the constraints and in very reduced computing time.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Automated Symmetry Breaking and Model Selection in CONJURE

Automated Symmetry Breaking and Model Selection in CONJURE

引用

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

作者： Akgun, Ozgur Frisch, Alan M. Gent, Ian P. Hussain, Bilal Syed Jefferson, Christopher Kotthoff, Lars Miguel, Ian Nightingale, Peter Univ St Andrews St Andrews KY16 9AJ Fife Scotland Univ York York YO10 5DD N Yorkshire England Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783642406263;9783642406270

constraint modelling is widely recognised as a key bottleneck in applying constraint solving to a problem of interest. the CONJURE automated constraint modelling system addresses this problem by automatically refining constraint models from problem specifications written in the ESSENCE language. ESSENCE provides familiar mathematical concepts like sets, functions and relations nested to any depth. To date, CONJURE has been able to produce a set of alternative model kernels (i.e. without advanced features such as symmetry breaking or implied constraints) for a given specification. the first contribution of this paper is a method by which CONJURE can break symmetry in a model as it is introduced by the modelling process. this works at the problem class level, rather than just individual instances, and does not require an expensive detection step after the model has been formulated. this allows CONJURE to produce a higher quality set of models. A further limitation of CONJURE has been the lack of a mechanism to select among the models it produces. the second contribution of this paper is to present two such mechanisms, allowing effective models to be chosen automatically.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Nested constraint Programs

Nested Constraint Programs

引用

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

作者： Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Natl ICT Australia Dept Comp & Informat Syst Victoria Lab Melbourne Vic 3010 Australia

ISBN: (纸本)9783319104287;9783319104270

Many real world discrete optimization problems are expressible as nested problems where we solve one optimization or satisfaction problem as a subproblem of a larger meta problem. Nested problems include many important problem classes such as: stochastic constraint satisfaction/optimization, quantified constraint satisfaction/optimization and minimax problems. In this paper we define a new class of problems called nested constraint programs (Ncp) which include the previously mentioned problem classes as special cases, and describe a search-based cp solver for solving Ncp's. We briefly discuss how nogood learning can be used to significantly speedup such an Ncp solver. We show that the new solver can be significantly faster than existing solvers for the special cases of stochastic/quantified CSP/COP's, and that it can solve new types of problems which cannot be solved with existing solvers.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

To Encode or to Propagate? the Best Choice for Each constraint in SAT

To Encode or to Propagate? The Best Choice for Each Constrai...

引用

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

作者： Abio, Ignasi Nieuwenhuis, Robert Oliveras, Albert Rodriguez-Carbonell, Enric Stuckey, Peter J. Tech Univ Dresden Theoret Comp Sci Dresden Germany Tech Univ Catalonia Barcelona Spain Natl ICT Australia Sydney NSW Australia Univ Melbourne Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

Sophisticated compact SAT encodings exist for many types of constraints. Alternatively, for instances with many (or large) constraints, the SAT solver can also be extended with built-in propagators (the SAT Modulo theories approach, SMT). For example, given a cardinality constraint x(1) + ... + x(n) <= k, as soon as k variables become true, such a propagator can set the remaining variables to false, generating a so-called explanation clause of the form x(1) boolean AND ... boolean AND x(k) -> (x(i)) over bar. But certain "bottle-neck" constraints end up generating an exponential number of explanations, equivalent to a naive SAT encoding, much worse than using a compact encoding with auxiliary variables from the beginning. therefore, Abio and Stuckey proposed starting off with a full SMT approach and partially encoding, on the fly, only certain "active" parts of constraints. Here we build upon their work. Equipping our solvers with some additional bookkeeping to monitor constraint activity has allowed us to shed light on the effectiveness of SMT: many constraints generate very few, or few different, explanations. We also give strong experimental evidence showing that it is typically unnecessary to consider partial encodings: it is competitive to encode the few really active constraints entirely. this makes the approach amenable to any kind of constraint, not just the ones for which partial encodings are known.

关键词： Bottles

来源：评论

学校读者我要写书评

暂无评论

Non-binary constraints 5th

引用

5th international conference on principles and practice of constraint programming (cp 99)

作者： Bessière, C CNRS LIRMM F-34392 Montpellier France

ISBN: (纸本)3540666265

Since the origins of the constraint satisfaction paradigm, its restriction to binary constraints has concentrated a significant part of the work. this is understandable because new ideas/techniques are usually much simpler to present/elaborate by first restricting them to the binary case. (See for example the are consistency algorithms, such as AC-3 or AC-4, which have been presented first in their binary version [10, 12], before being extended to non-binary constraints [11, 13].) But this inclination has highly increased in the early nineties. Authors indeed justified this restriction by the fact that any non-binary constraint network can polyniomally be converted into an equivalent binary one [6,8,5,19]. And, in most cases, they never extended their work to non-binary constraints.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Globalizing constraint models

Globalizing constraint models

引用

19th international conference on principles and practice of constraint programming, cp 2013

作者： Leo, Kevin Mears, Christopher Tack, Guido Garcia De La Banda, Maria Faculty of IT Monash University Australia Victoria Laboratory Australia

ISBN: (纸本)9783642406263

We present a method that, given a constraint model, suggests global constraints to replace parts of it. this helps non-expert users to write higher-level models that are easier to reason about and may result in better solving performance. Our method exploits the structure of the model by considering combinations of the constraints, collections of variables, parameters and loops already present in the model, as well as parameter data from several data files. We assign a score to a candidate global constraint by comparing a sample of its solution space with that of the part of the model it is intended to replace. the top-scoring global constraints are presented to the user through an interactive display, which shows how they could be incorporated into the model. the MiniZinc Globalizer, our implementation of the method for the MiniZinc modelling language, is available on the web. © 2013 Springer-Verlag.

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

来源：评论

学校读者我要写书评

暂无评论

Introducing external functions in constraint query languages 4th

引用

4th international conference on principles and practice of constraint programming (cp 98)

作者： Catania, B Belussi, A Bertino, E Univ Milan Dipartimento Sci Informaz I-20135 Milan Italy Univ Verona Fac Sci Matemat Fis & Nat I-37134 Verona Italy

ISBN: (纸本)3540652248

constraint databases use constraints to model and query data. In particular, constraints allow a finite representation of infinite sets of relational tuples (also called generalized tuples). the choice of different logical theories to express constraints inside relational languages leads to the definition of constraint languages with different expressive power. Practical constraint database languages typically use linear constraints. this choice allows the use of efficient algorithms but, at the same time, some useful queries, needed by the considered application, may not be represented inside the resulting languages (for example, the convex hull cannot be computed [19]). these additional queries can only be modeled by changing the theory (thus, loosing the advantages of the linear theory), or extending the language, or using external functions. In this paper we consider the last approach and we propose an algebra and a calculus for constraint relational databases extended with external functions, formally proving their equivalence. In doing that, we use an approach similar to the one used by Klug to prove the equivalence between the relational algebra and the relational calculus extended with aggregate functions [14]. As far as we know, this is the first approach to introduce external functions in constraint query languages.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：