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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Generating Special-Purpose Stateless Propagators for Arbitrary constraints

Generating Special-Purpose Stateless Propagators for Arbitra...

引用

16th Annual international conference on the principles and practice of constraint programming

作者： Gent, Ian P. Jefferson, Chris Miguel, Ian Nightingale, Peter Univ St Andrews Sch Comp Sci St Andrews Fife Scotland

ISBN: (纸本)9783642153952

Given an arbitrary constraint a on 71 variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation that would be performed on every reachable subdomain of scope(c). Our propagators are stateless: they store no state between calls, and so incur no overhead in storing and backtracking state during search. the preprocessing step can take exponential time and the custom propagator is potentially exponential in size. However, for small constraints used repeatedly, in one problem or many, this technique can provide substantial practical gains. Our experimental results show that, compared with optimised implementations of the table constraint;this technique can lead to an order of magnitude speedup;while doing identical search on realistic problems. the technique can also be many times faster than a decomposition into primitive constraints in the Minion solver. Propagation is so fast that, for constraints available in our solver, the generated propagator compares well with a human-optimised propagator for the same constraint.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cost-Based Domain Filtering for Stochastic constraint programming

引用

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

作者： Rossi, Roberto Tarim, S. Armagan Hnich, Brahim Prestwich, Steven Univ Coll Cork Constraint Computat Ctr CTVR Cork Ireland Hacettepe Univ Dept Management Ankara Turkey Izmir Univ Econ Fac Comp Sci Izmir Turkey

ISBN: (纸本)9783540859574

Cost based filtering is a novel approach that combines techniques from Operations Research and constraint programming to filter from decision variable domains values that, do not lead to better solutions [7]. Stochastic: constraint programming is a. framework for modeling combinatorial optimization problems that, involve uncertainty [19]. In this work;we show how to perform cost;based filtering for certain classes of stochastic constraint, programs. Our approach is based oil a set of known inequalities borrowed from Stochastic programming - a branch of OR. concerned with modeling and solving problems involving. uncertainty. We discuss bound generation and cost-based domain filtering procedures for a well-known problem in the Stochastic. programming literature, the static stochastic knapsack problem. We also apply our technique to a stochastic sequencing problem. Our results clearly show the value of the proposed approach over;I pure scenario-based Stochastic constraint programming formulation both in terms of explored nodes and run times.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

An abstract interpretation based combinator for modelling while loops in constraint programming

An abstract interpretation based combinator for modelling wh...

引用

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

作者： Denmat, Tristan Gotlieb, Arnaud Ducasse, Mireille INSA IRISA Campus Univ Beaulieu F-35042 Rennes France INRIA IRISA F-35042 Rennes France

ISBN: (纸本)9783540749691

We present the w constraint combinator that models while loops in constraint programming. Embedded in a finite domain constraint solver, it allows programmers to develop non-trivial arithmetical relations using loops, exactly as in an imperative language style. the deduction capabilities of this combinator come from abstract interpretation over the polyhedra abstract domain. this combinator has already demonstrated its utility in constraint- based verification and we argue that it also facilitates the rapid prototyping of arithmetic constraints (e.g. power, gcd or sum).

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Financial portfolio optimisation

引用

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

作者： Flener, Pierre Pearson, Justin Reyna, Luis G. Department of Information Technology Uppsala University Box 337 Uppsala751 05 Sweden Global Private Investment Advisory Group Merrill Lynch New YorkNY10281-1307 United States

ISBN: (纸本)3540232419

We give an approximate and often extremely fast method of solving a portfolio optimisation (PO) problem in financial mathematics, which has applications in the credit derivatives market. Its corresponding satisfaction problem is closely related to the balanced incomplete block design (BIBD) problem. However, typical PO instances are an order of magnitude larger than the largest BIBDs solved so far by global search. Our method is based on embedding sub-instances into the original instance. their determination is itself a CSP. this allows us to solve a typical PO instance, with over 10746 symmetries. the high quality of our approximate solutions can be assessed by comparison with a tight lower bound on the cost. Also, our solutions sufficiently improve the currently best ones so as to often make the difference between having or not having a feasible transaction due to investor and rating-agency constraints. © Springer-Verlag Berlin Heidelberg 2004.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Consistency maintenance for ABT 1

引用

7th international conference on principles and practice of constraint programming, cp 2001

作者： Silaghi, Marius-Călin Sam-Haroud, Djamila Faltings, Boi EPFL CH-1015 Switzerland

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such a combination in asynchronous settings1. the difficulty in this case is that, in the usual algorithms, the instantiation and consistency enforcement steps must alternate sequentially. When brought to a distributed setting, a similar approach forces the search algorithm to be synchronous in order to benefit from consistency maintenance. Asynchronism [24,14] is highly desirable since it increases flexibility and parallelism, and makes the solving process robust against timing variations. One of the most well-known asynchronous search algorithms is Asynchronous Backtracking (ABT). this paper shows how an algorithm for maintaining consistency during distributed asynchronous search can be designed upon ABT. the proposed algorithm is complete and has polynomial-space complexity. Since the consistency propagation is optional, this algorithms generalizes forward checking as well as chronological backtracking. An additional advance over existing centralized algorithms is that it can exploit available backtracking-nogoods for increasing the strength of the maintained consistency. the experimental evaluation shows that it can bring substantial gains in computational power compared with existing asynchronous algorithms. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Maintaining arc-consistency within dynamic backtracking 6th

引用

6th international conference on principles and practice of constraint programming, cp2000

作者： Jussien, Narendra Debruyne, Romuald Boizumault, Patrice École des Mines de Nantes 4 rue Alfred Kastler – BP 20722 Nantes Cedex 3F-44307 France

ISBN: (纸本)3540410538

Most of complete search algorithms over constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been studied: first, to integrate constraint propagation as mac which maintains arc consistency during search;second, intelligent backtrackers which avoid repeatedly falling in the same dead-ends by recording nogoods as Conflict-directed BackJumping (cbj) or Dynamic Backtracking (dbt). Integrations of constraint propagation within intelligent backtrackers have been done as mac-cbj which maintains arc consistency in cbj. However, Bessière and Règin have shown that mac-cbj was very rarely better than mac. However, the inadequacy of mac-cbj is more related to the fact that cbj does not avoid thrashing than to the cost of the management of nogoods. this paper describes and evaluates mac-dbt which maintains arc-consistency in dbt. Experiments show that mac-dbt is able to solve very large problems and that it remains very stable as the size of the problems increases. Moreover, mac-dbt outperforms mac on the structured problems we have randomly generated. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：