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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

75 篇 会议
10 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

83 篇 工学
- 82 篇 计算机科学与技术...
- 19 篇 软件工程
- 1 篇 电气工程
- 1 篇 控制科学与工程
20 篇 理学
- 17 篇 数学
- 8 篇 系统科学
- 1 篇 统计学（可授理学、...
1 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

34 篇 constraint theor...
8 篇 constraint satis...
4 篇 symmetry
3 篇 constraint satis...
3 篇 global constrain...
2 篇 modeling
2 篇 runtime distribu...
2 篇 binary decision ...
2 篇 problem solving
2 篇 chanelling const...
2 篇 distributed ai
2 篇 ad-hoc constrain...
2 篇 generalized arc ...
2 篇 table constraint
2 篇 constraint handl...
2 篇 multi-valued dec...
2 篇 search
2 篇 non-binary const...
2 篇 ad hoc constrain...
2 篇 still-life probl...

机构

6 篇 natl univ irelan...
4 篇 natl univ singap...
4 篇 univ oxford comp...
4 篇 natl univ irelan...
3 篇 ben gurion univ ...
3 篇 chinese univ hon...
2 篇 nicta nsw
2 篇 ecole polytech m...
2 篇 univ london roya...
2 篇 insight centre f...
2 篇 carnegie mellon ...
2 篇 cornell univ dep...
2 篇 univ st andrews ...
2 篇 univ london roya...
2 篇 univ connecticut...
2 篇 univ montpellier...
2 篇 izmir univ econ ...
2 篇 chinese univ hon...
2 篇 vidus ltd ipswic...
1 篇 inra toulouse

作者

7 篇 o'sullivan barry
5 篇 smith barbara m.
4 篇 hulubei tudor
4 篇 bessiere christi...
4 篇 yap roland h. c.
4 篇 cheng kenil c. k...
3 篇 cohen david
3 篇 hnich brahim
3 篇 meisels amnon
3 篇 quesada luis
3 篇 walsh toby
3 篇 zivan roie
2 篇 prestwich steven...
2 篇 rousseau louis-m...
2 篇 van hentenryck p...
2 篇 jefferson christ...
2 篇 khemmoudj mohand...
2 篇 gent ian p.
2 篇 escamocher guill...
2 篇 jeavons peter

语言

87 篇 英文
1 篇 中文

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

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

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

详细简洁

排序：

Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers

Sequential Time Splitting and Bounds Communication for a Por...

引用

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

作者： Amadini, Roberto Stuckey, Peter J. Univ Bologna Dept Comp Sci & Engn Lab Focus INRIA I-40126 Bologna Italy Univ Melbourne Dept Informat Syst & Comp Melbourne Vic 3010 Australia

ISBN: (纸本)9783319104287;9783319104270

Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for constraint Optimization Problems (COPs). Unlike CSPs, sequential execution of optimization solvers can communicate information in the form of bounds to improve the performance of the following solvers. We provide a hybrid and flexible portfolio approach that combines static and dynamic time splitting for solving a given COP. Empirical evaluations show the approach is promising and sometimes even able to outperform the best solver of the porfolio.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

the Impact of Wireless Communication on Distributed constraint Satisfaction

The Impact of Wireless Communication on Distributed Constrai...

引用

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

作者： Wahbi, Mohamed Brown, Kenneth N. Univ Coll Cork Insight Ctr Data Analyt Sch Comp Sci & IT Cork Ireland

ISBN: (纸本)9783319104287;9783319104270

Distributed constraint satisfaction (DisCSP) models decision problems where physically distributed agents control different decision variables, but must communicate with each other to agree on a global solution. Most DisCSP research assumes an abstract communication layer based on a peer-to-peer wired network. However, many practical applications of distributed reasoning require to be implemented over wireless networks, which impose different communication costs, and may affect the performance of DisCSP algorithms. We study the impact of wireless network topology and routing on two leading DisCSP algorithms -ABT and AFC-ng. We introduce a new framework for experiments which models different communication layers. We show that the communication layer has a significant impact on the messaging costs, which can vary by over an order of magnitude. We also show the impact on computation time, where the equivalent non-concurrent constraint checks can vary by a factor of 6. Finally, we show that given a fixed agent ordering, changing the communications topology can increase the number of messages by up to 50%.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Robustness and Stability in constraint programming under Dynamism and Uncertainty

Robustness and Stability in Constraint Programming under Dyn...

引用

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

作者： Climent, Laura Wallace, Richard J. Salido, MiguelA. Barber, Federico Natl Univ Ireland Univ Coll Cork Insight Ctr Data Analyt Cork Ireland Univ Politecn Valencia Inst Automat Informat Ind Madrid Spain

ISBN: (纸本)9783319104287;9783319104270

Because of the dynamism and uncertainty associated with many real life problems, these problems and their associated constraint Satisfaction Problem (CSP) models may change over time; thus an earlier solution found for the latter may become invalid. Moreover, many approaches proposed in the literature cannot be applied when the required information about dynamism is unknown ([9], [4], [5], [11], [10], etc.). this fact has motivated us to consider dynamic situations where, in addition, only limited assumptions about changes can be made. Our analysis focuses on CSPs with ordered and discrete domains that model problems for which the order over the elements of the domain is significant. In these cases, a common type of change that problems may undergo is restrictive modifications over the bounds of the solution space. A discussion of these assumptions, their motivation and real life examples can be found in [3]. In this paper, we present an algorithm that meets the goal of combining solution stability (meaning that solutions can often be repaired using other similar values if they undergo a value loss) and robustness (meaning that solutions have a high likelihood of remaining solutions after changes). the desireability of this combination of features was noted in the survey [8]. Furthermore, in this work we have extended both concepts to apply to the type of CSP analyzed. the paper is organized as follows. Section 2 presents the new conceptions of robustness and stability. Section 3 describes our approach for finding solutions that simultaneously meet both these criteria. In Section 4 we present some experimental results. Section 5 gives conclusions.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Model Combinators for Hybrid Optimization

Model Combinators for Hybrid Optimization

引用

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

作者： Fontaine, Daniel Michel, Laurent Van Hentenryck, Pascal Univ Connecticut Storrs CT 06269 USA Univ Melbourne NICTA Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

In recent years, CML, G12 and SIMPL, have achieved significant progress in automating the generation of hybrid solvers from high-level model specifications. this paper pushes this research direction one step further and introduces the concept of model combinators to provide principled model compositions. these model combinators rely on runnables capturing executable models, runnable signatures that capture what runnables can produce and consume, and model hierarchies, which track relationships among models. these concepts make it possible to enforce the soundness of model compositions and to determine the best model compositions automatically. A prototype of the framework on top of the Objective-cp optimization system is presented.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming: Boolean constraint Solving for Knowledge Representation and Reasoning

Answer Set Programming: Boolean Constraint Solving for Knowl...

引用

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

作者： Schaub, Torsten Simon Fraser Univ Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642406263;9783642406270

Answer Set programming (ASP; [1,2,3]) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance Boolean constraint solving capacities. ASP is particularly suited for modeling problems in the area of Knowledge Representation and Reasoning involving incomplete, inconsistent, and changing information. As such, it offers, in addition to satisfiability testing, various reasoning modes, including different forms of model enumeration, intersection or unioning, as well as multi-criteria and -objective optimization. From a formal perspective, ASP allows for solving all search problems in NP (and NP NP ) in a uniform way. Hence, ASP is wellsuited for solving hard combinatorial search problems, like system design and timetabling. Prestigious applications of ASP include composition of Renaissance music [4], decision support systems for NASA shuttle controllers [5], reasoning tools in systems biology [6,7,8] and robotics [9,10], industrial team-building [11], and many more. the versatility of ASP is nicely reflected by the ASP solver clasp [12], winning first places at various solver competitions, such as ASP,MISC, PB, and SAT competitions. the solver clasp is at the heart of the open source platform Potassco hosted at *** . Potassco stands for the “Potsdam Answer Set Solving Collection-[13] and has seen more than 30000 downloads world-wide since its inception at the end of 2008. the talk will start with an introduction to ASP, its modeling language and solving methodology, and portray some distinguished ASP systems.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

constraints in Software Testing, Verification and Analysis CSTVA 2013

Constraints in Software Testing, Verification and Analysis C...

引用

6th IEEE international conference on Software Testing, Verification and Validation (ICST)

作者： Cadar, Cristian Dadeau, Frederic Univ London Imperial Coll Sci Technol & Med South Kensington Campus London SW7 2AZ England INRIA CASSIS FEMTO ST Inst F-25030 Besancon France

ISBN: (纸本)9780769549934;9781479913244

Recent years have seen an increasing interest in the application of constraint solving techniques to test, verify and analyze software systems. A significant body of constraint-based techniques has been proposed and investigated in the context of test input generation, model-based testing, symbolic execution, static analysis, program verification, and many other areas. these techniques use or extend constraint solvers such as SAT and SMT solvers to reason about boolean, integer, real and floating-point data types, as well as complex data structures, control structures, method calls and other program features. the constraint systems that result from this work usually share many common features and are relevant to a variety of application domains. Following a first meeting held with the principles and practice of constraint programming (cp) conference in 2006, and three subsequent meetings at the international conference on Software Testing, Verification and Validation (ICST) in 2010, 2011 and 2012, the aim of this paper is to bring together researchers and practitioners working in constraint-based software testing, verification and analysis, to investigate future developments in this research field.

关键词： constraint handling formal verification program testing

来源：评论

学校读者我要写书评

暂无评论

the semigroups of order 10

The semigroups of order 10

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Distler, Andreas Jefferson, Chris Kelsey, Tom Kotthoff, Lars Centro de Álgebra Universidade de Lisboa Lisboa 1649-003 Portugal School of Computer Science University of St. Andrews KY16 9SX United Kingdom

ISBN: (纸本)9783642335570

the number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed constraint Satisfaction to show that the number of non-equivalent semigroups of order 10 is 12,418,001,077,381,302,684. this solves a previously open problem in Mathematics, and has directly led to improvements in constraint Satisfaction technology. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Comparing solution methods for the machine reassignment problem

Comparing solution methods for the machine reassignment prob...

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Mehta, Deepak O'Sullivan, Barry Simonis, Helmut Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783642335570

the machine reassignment problem is defined by a set of machines and a set of processes. Each machine is associated with a set of resources, e.g. cpU, RAM etc., and each process is associated with a set of required resource values and a currently assigned machine. the task is to reassign the processes to machines while respecting a set of hard constraints in order to improve the usage of the machines, as defined by a complex cost function. We present a natural constraint programming (cp) formulation of the problem that uses a set of well-known global constraints. However, this formulation also requires new global constraints. Additionally, the instances are so large that systematic search is not practical especially when the time is limited. We therefore developed a cp formulation of the problem that is especially suited for a large neighborhood search approach (LNS). We also experimented with a mixed-integer programming (MIP) model for LNS. We first compare our formulations on a set of ROADEF'12 problem instances where the number of processes and machines are restricted to 1000 and 100 respectively. Both MIP and cp-based LNS approaches find solutions that are significantly better than the initial ones and compare well to other submitted entries. We further investigate their performances on larger instances where the number of processes and machines can be up to 50000 and 5000 respectively. the results suggest that our cp-based LNS can scale to large instances and is superior in memory use and the quality of solutions that can be found in limited time. © 2012 Springer-Verlag.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

constraint Based Scheduling to Deal with Uncertain Durations and Self-Timed Execution

Constraint Based Scheduling to Deal with Uncertain Durations...

引用

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

作者： Lombardi, Michele Milano, Michela Univ Bologna DEIS I-40136 Bologna Italy

ISBN: (纸本)9783642153952

In this paper we propose off-line and on-line extensions to the Resource Constrained Project Scheduling Problem. the off-line extension is a variant of RcpSP with time lags and uncertain, bounded activity durations. In this context we improve over our previous work presented in [12] by proposing an incremental flow computation for finding minimal conflict sets and a set of filtering rules for cumulative constraint propagation. the on-line extension is based instead on considering an on-line semantics such as the Self-Timed Execution and take it into account in the scheduling process. Adding the on-line aspect to the problem makes the CSP framework no longer suitable. We have extended the CSP framework to take into account general search decisions and auxiliary unbound variables. An extensive set of experimental results show an improvement

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：