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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

131 篇 会议
3 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

118 篇 工学
- 114 篇 计算机科学与技术...
- 38 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 化学工程与技术
68 篇 理学
- 60 篇 数学
- 21 篇 系统科学
- 4 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
11 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 教育学

主题

26 篇 constraint theor...
14 篇 constraint satis...
9 篇 computer program...
8 篇 constraint progr...
6 篇 linear programmi...
4 篇 integer programm...
3 篇 target cost
3 篇 problem solving
3 篇 goal programming
3 篇 mathematical log...
3 篇 programming lang...
3 篇 artificial intel...
3 篇 logics and meani...
3 篇 scheduling
2 篇 software enginee...
2 篇 modeling languag...
2 篇 symmetry
2 篇 constrained opti...
2 篇 logic programmin...
2 篇 global constrain...

机构

3 篇 univ coll cork c...
3 篇 univ st andrews ...
3 篇 univ oxford comp...
3 篇 natl univ irelan...
3 篇 univ melbourne m...
3 篇 brown univ provi...
2 篇 univ st andrews ...
2 篇 nicta nsw
2 篇 insight centre f...
2 篇 univ genoa dibri...
2 篇 cork constraint ...
2 篇 univ coll cork d...
2 篇 univ london roya...
2 篇 imdea software i...
2 篇 aix marseille un...
2 篇 aix marseille un...
2 篇 univ coll cork c...
2 篇 faculty of elect...
2 篇 univ st andrews ...
1 篇 ligm ecole des p...

作者

6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 o'sullivan barry
5 篇 miguel ian
5 篇 van hentenryck p...
5 篇 jefferson christ...
5 篇 quesada luis
4 篇 kotthoff lars
4 篇 bessiere christi...
4 篇 de givry simon
3 篇 stuckey peter j.
3 篇 werner tomáš
3 篇 jeavons peter
3 篇 simonis helmut
3 篇 lombardi michele
3 篇 walsh toby
3 篇 dlask tomáš
3 篇 mehta deepak
2 篇 pearson justin
2 篇 solnon christine

语言

136 篇 英文

检索条件"任意字段=16th Annual International Conference on the Principles and Practice of Constraint Programming"

共 136 条记录，以下是71-80 订阅

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

详细简洁

排序：

TURTLE++ –a CIP-library for C++ 16th

引用

16th international conference on Applications of Declarative programming and Knowledge Management, INAP 2005

作者： Hofstedt, Petra Krzikalla, Olaf Technical University of Berlin

ISBN: (纸本)9783540692331

this article introduces the turtle++ library which combines constraint-based and imperative paradigms and enables in this way constraint imperative programming (CIP) with c++. Integrating CIP into c++ allows to exploit the powerful expressiveness of the CIP paradigm within a language widely used and accepted in practice. We discuss the main concepts and implementation and illustrate programming with turtle++ by means of typical examples. © Springer-Verlag Berlin Heidelberg 2006.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming – CP 2010 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： David Cohen

ISBN: (数字)9783642153969

ISBN: (纸本)9783642153952

the 16th annual international conference on the principles and practice of constraint programming (CP 2010) was held in St. Andrews, Scotland, during September 6–10, 2010. We would like to thank our sponsors for their generous support of this event. this conference is concerned with all aspects of computing with constraints, including:theory,algorithms,applications,environments,languages,modelsand systems. We received a wide variety of submissions, each of which was reviewed by at least three referees. Referees were chosen for each submission by an initial bidding process where Program Committee members chose papers from their area of interest. the range of expertise represented by the large Program C- mittee meant that almost all submissions were reviewed by subject experts on the Program Committee, or by colleagues chosen by members of the Program Committee for their particular expertise. Papers weresolicitedeither as long (15 page), or short (8 page) submissions. Short-paper submissions were refereed to exactly the same high standards as long-paper submissions but naturally were expected to contain a smaller quantity of new material. thus there is no disti- tion in these proceedings between short and long papers. I used the excellent EasyChair conference management system to support this process of reviewing, and for the collation and organization of these proceedings. Submissions were made either to the applications track or to the research track. therewere101(23short)researchtracksubmissionsofwhich36(8short) wereaccepted,whichisa36%(35%ofshort)acceptancerate. Applicationstrack submissions received special consideration and the acceptance rate was sign- cantly higher than for the research track.

关键词： Software Engineering/programming and Operating Systems programming Techniques programming Languages, Compilers, Interpreters Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Logics and Meanings of Programs

来源：评论

学校读者我要写书评

暂无评论

Modelling Destructive Assignments

Modelling Destructive Assignments

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Francis, Kathryn Navas, Jorge Stuckey, Peter J. Natl ICT Australia Victoria Res Lab Melbourne Vic 3010 Australia Univ Melbourne Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

Translating procedural object oriented code into constraints is required for many processes that reason about the execution of this code. the most obvious is for symbolic execution of the code, where the code is executed without necessarily knowing the concrete values. In this paper, we discuss translations from procedural object oriented code to constraints in the context of solving optimisation problems defined via simulation. A key difficulty arising in the translation is the modelling of state changes. We introduce a new technique for modelling destructive assignments that outperforms previous approaches. Our results show that the optimisation models generated by our technique can be as efficient as equivalent hand written models.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Minimising Decision Tree Size as Combinatorial Optimisation

Minimising Decision Tree Size as Combinatorial Optimisation

引用

15th international conference on principles and practice of constraint programming (CP 2009)

作者： Bessiere, Christian Hebrard, Emmanuel O'Sullivan, Barry LIRMM Montpellier France Univ Coll Cork Cork Constraint Computat Ctr Dept Comp Sci Cork Ireland

ISBN: (纸本)9783642042430

Decision tree induction techniques attempt to find small trees that fit a training set of data. this preference for smaller trees, which provides a learning bias, is often justified its being consistent with the principle of Occam's Razor. Informally, this principle states that One Should prefer the simpler hypothesis. In this paper we take this principle to the extreme. Specifically, we formulate decision tree induction its it combinatorial optimisation problem in which the objective is to minimise the number of nodes in the tree. We study alternative formulations based on satisfiability, constraint programming, and hybrids with integer linear programming. We empirically compare Our approaches against standard induction algorithms, showing that the decision trees we obtain can sometimes be less than half the size of those found by other greedy methods. Furthermore, our decision trees are competitive in terms of accuracy on a variety of well-known benchmarks, often being the most accurate. Even when post-pruning of greedy trees is used, Our constraint-based approach is never dominated by any of the existing techniques.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Dominance Driven Search

Dominance Driven Search

引用

19th annual international conference on principles and practice of constraint programming (CP)

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

ISBN: (纸本)9783642406263;9783642406270

Recently, a generic method for identifying and exploiting dominance relations using dominance breaking constraints was proposed. In this method, sufficient conditions for a solution to be dominated are identified and these conditions are used to generate dominance breaking constraints which prune off the dominated solutions. We propose to use these dominance relations in a different way in order to boost the search for good/optimal solutions. In the new method, which we call dominance jumping, when search reaches a point where all solutions in the current domain are dominated, rather than simply backtrack as in the original dominance breaking method, we jump to the subtree which dominates the current subtree. this new strategy allows the solver to move from a bad subtree to a good one, significantly increasing the speed with which good solutions can be found. Experiments across a range of problems show that the method can be very effective when the original search strategy was not very good at finding good solutions.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

the Berth Allocation and Quay Crane Assignment Problem Using a CP Approach

The Berth Allocation and Quay Crane Assignment Problem Using...

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Zampelli, Stephane Vergados, Yannis Van Schaeren, Rowan Dullaert, Wout Raa, Birger Dynam Decis Technol Providence RI 02902 USA Brown Univ Providence RI 02912 USA Antwerp Maritime Acad Antwerp Belgium Free Univ Amsterdam Dept Informat & Logist & Innovat NL-1081 HV Amsterdam Netherlands Univ Antwerp Inst Transport & Maritime Management Antwerp Antwerp Belgium Univ Ghent B-9000 Ghent Belgium

ISBN: (纸本)9783642406263;9783642406270

this paper considers the combination of berth and crane allocation problems in container terminals. We propose a novel approach based on constraint programming which is able to model many realistic operational constraints. the costs for berth allocation, crane allocation, time windows, breaks and transition times during gang movements are optimized simultaneously. the model is based on a resource view where gangs are consumed by vessel activities. Side constraints are added independently around this core model. the model is richer than the state of the art in the operations research community. Experiments show that the model produces solutions with a cost gap of 1/10 (7,8%) to 1/5 (18,8%) compared to an ideal operational setting where operational constraints are ignored.

关键词： berth allocation crane assignment containers terminal constraint 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

来源：评论

学校读者我要写书评

暂无评论

Blowing Holes in Various Aspects of Computational Problems, with Applications to constraint Satisfaction

Blowing Holes in Various Aspects of Computational Problems, ...

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Jonsson, Peter Lagerkvist, Victor Nordh, Gustav Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

ISBN: (纸本)9783642406263;9783642406270

We consider methods for constructing NP-intermediate problems under the assumption that P not equal NP. We generalize Ladner's original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-intermediate subproblems for a broad and natural class of parameterizations, and extend the result further such that structural CSP restrictions based on parameters that are hard to compute (such as tree-width) are covered. Hereby we generalize a result by Grohe on width parameters and NP-intermediate problems. For studying certain classes of problems, including CSPs parameterized by constraint languages, we consider more powerful parameterizations. First, we identify a new method for obtaining constraint languages G such that CSP(G) are NP-intermediate. the sets G can have very different properties compared to previous constructions (by, for instance, Bodirsky & Grohe) and provides insights into the algebraic approach for studying the complexity of infinite-domain CSPs. Second, we prove that the propositional abduction problem parameterized by constraint languages admits NP-intermediate problems. this settles an open question posed by Nordh & Zanuttini.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Using Object-Oriented Design Techniques in Performance Modelling 16

Using Object-Oriented Design Techniques in Performance Model...

引用

16th international Computer Measurement Group conference, CMG 1990

作者： Smith, Kevin F. Performance Evaluation Laboratory General Products Division International Business Machines Corporation 5600 Cottle Rd. San JoseCA95193 United States

Object-oriented programming is a hot topic these days. Unfortunately, a wide gap exists between the frequency with which its virtues are touted and our own opportunities to actually use it. In fact, in many installations, an object-oriented programming language cannot even be found. Although the availability of object-oriented programming languages may be limited for many of us, there are many ways that its principles can be applied in the software we design today. this seems to be particularly true in the area of performance modelling. In this paper we address how to design a program using an object-oriented design methodology. We also discuss how to code that design using a conventional programming language, while attempting to preserve as much of its object-oriented flavor as possible. Performance considerations in the target language are also investigated. © Performance Associates, Inc., 1990.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：