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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

An Integrated Business Rules and constraints Approach to Data Centre Capacity Management

An Integrated Business Rules and Constraints Approach to Dat...

引用

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

作者： van der Krogt, Roman Feldman, Jacob Little, James Stynes, David Univ Coll Cork Cork Constraint Computat Ctr Dept Comp Sci Cork Ireland

ISBN: (纸本)9783642153952

A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others are pushed to the limits of their capacity. Tins in turn leads to decreased response times on the overloaded servers, a situation that the data centre provider wants to prevent. To solve this problem, an administrator may move (reallocate) applications or even entire virtual servers around in order to spread the load. Since there is a cost associated with moving applications (in the form of down time during the move, for example), we are interested in solutions with minimal changes. this paper describes a hybrid approach to solving such resource reallocation problems in data centres, where two technologies have to work closely together to solve this problem in an efficient manner. the first technology is a Business Rules Management System (BRMS), which is used to identify which systems are considered to be overloaded on a systematic basis. Data centres use complex rules to track the behaviour of the servers over time, in order to properly identify overloads. Representing these tracking conditions is what the BRMS is good for. It defines the relationships (business constraints) over time between different applications, processes and required resources that are specific to the data centre. As such, it also allows a high degree of customisation. Having identified which servers require reallocation of their processes, the BRMS then automatically creates an optimisation model solved with a constraint programming (CP) approach. A CP solver finds a feasible or the optimal solution to this CSP, which is used to provide recommendations on which workload should be moved and whereto. Notice that our use of a hybrid approach is a requirement, not a feature: employing only rules we would not be able to compute an optimal solution;using only CP we would not be able to specify the complex identification

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Testing continuous double auctions with a constraint-based oracle

Testing continuous double auctions with a constraint-based o...

引用

16th international conference on principles and practice of constraint programming, CP 2010

作者： Castañeda Lozano, Roberto Schulte, Christian Wahlberg, Lars KTH - Royal Institute of Technology Sweden Cinnober Financial Technology AB Stockholm Sweden

ISBN: (纸本)364215395X

Computer trading systems are essential for today's financial markets where the trading systems' correctness is of paramount economical significance. Automated random testing is a useful technique to find bugs in these systems, but it requires an independent system to decide the correctness of the system under test (known as oracle problem). this paper introduces a constraint-based oracle for random testing of a real-world trading system. the oracle provides the expected results by generating and solving constraint models of the trading system's continuous double auction. constraint programming is essential for the correctness of the test oracle as the logic for calculating trades can be mapped directly to constraint models. the paper shows that the generated constraint models can be solved efficiently. Most importantly, the approach is shown to be successful by finding errors in a deployed financial trading system and in its specification. © 2010 Springer-Verlag.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

An Alternative to SAT-Based Approaches for Bit-Vectors

An Alternative to SAT-Based Approaches for Bit-Vectors

引用

16th international conference on Tools and Algorithms for the Construction and Analysis of Systems held at the 13th Joint European conferences on theory and practice of Software

作者： Bardin, Sebastien Herrmann, Philippe Perroud, Florian CEA LIST Software Safety Lab F-91191 Gif Sur Yvette France

ISBN: (纸本)9783642120015

the theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solvers for this theory are based on a bit-level encoding into propositional logic and SAT-based resolution techniques. In this paper, we investigate an alternative approach based on a word-level encoding into bounded arithmetic and constraint Logic programming (CLP) resolution techniques. We define an original CLP framework (domains and propagators) dedicated to bit-vector constraints. this framework is implemented in a prototype and thorough experimental studies have been conducted. the new approach is shown to perform much better than standard CLP-based approaches, and to considerably reduce the gap with the best SAT-based BV solvers.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A new hybrid tractable class of soft constraint problems

A new hybrid tractable class of soft constraint problems

引用

16th international conference on principles and practice of constraint programming, CP 2010

作者： Cooper, Martin C. Živný, Stanislav IRIT University of Toulouse III 31062 Toulouse France Computing Laboratory University of Oxford OX1 3QD Oxford United Kingdom

ISBN: (纸本)364215395X

the constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractability in such problems. In this paper we study hybrid tractability of soft constraint problems;that is, properties which guarantee tractability of the given soft constraint problem, but properties which do not depend only on the underlying structure of the instance (such as being tree-structured) or only on the types of soft constraints in the instance (such as submodularity). We firstly present two hybrid classes of soft constraint problems defined by forbidden subgraphs in the structure of the instance. these classes allow certain combinations of binary crisp constraints together with arbitrary unary soft constraints. We then introduce the joint-winner property, which allows us to define a novel hybrid tractable class of soft constraint problems with soft binary and unary constraints. this class generalises the SoftAllDiff constraint with arbitrary unary soft constraints. We show that the joint-winner property is easily recognisable in polynomial time and present a polynomial-time algorithm based on maximum-flows for the class of soft constraint problems satisfying the joint-winner property. Moreover, we show that if cost functions can only take on two distinct values then this class is maximal. © 2010 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Research on Target Cost Control of Construction Project based on Goal programming

Research on Target Cost Control of Construction Project base...

引用

IEEE 16th international conference on Industrial Engineering and Engineering Management

作者： Zhao, H. He, G. Shenyang Univ Technol Sch Management Shenyang Peoples R China

ISBN: (纸本)9781424436705

Target cost control of construction projects is an important part of project management, and it plays a crucial role on the benefit of construction projects. In this paper, the issue about target cost control on the early stage of construction projects has been explored further. Firstly, this paper elaborates on determination principles and measurement methods of target cost of construction projects. Secondly, through the establishment of target cost programming model of construction projects and the use of simplex method on the linear programming, the established target cost programming model has been solved and the satisfied value of target cost control of construction projects has been determined based on final solution of the model. Finally, the application of method has been verified in practice. the purpose on target cost control of construction project has been achieved qualitatively and quantitatively. the effective control about target cost of construction projects on the early stage has been ensured.

关键词： Target cost goal programming simplex method

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research on Target Cost Control of Construction Project based on Goal programming

Research on Target Cost Control of Construction Project base...

引用

2009 IEEE 16th international conference on Industrial Engineering and Engineering Management(IEEE第16届工业工程与工程管理国际学术会议)

作者： H.Zhao G.He School of Management Shenyang University of TechnologyShenyangP.R.China

ISBN: (纸本)9781424436712

Target cost control of construction projects is an important part of project management,and it plays a crucial role on the benefit of construction projects. In this paper,the issue about target cost control on the early stage of construction projects has been explored further. Firstly,this paper elaborates on determination principles and measurement methods of target cost of construction projects. secondly,through the establishment of target cost programming model of construction projects and the use of simplex method on the linear programming,the established target cost programming model has been solved and the satisfied value of target cost control of construction projects has been determined based on final solution of the model. Finally,the application of method has been verified in practice. the purpose on target cost control of construction project has been achieved qualitatively and quantitatively. the effective control about target cost of construction projects on the early stage has been ensured.

关键词： Target cost goal programming simplez method

来源：评论

学校读者我要写书评

暂无评论

Research on Target Cost Control of Construction Project based on Goal programming

Research on Target Cost Control of Construction Project base...

引用

2009 IEEE the 16th international conference on Industrial Engineering and Engineering Management

作者： H. Zhao1 G. He2 1 School of Management Shenyang University of Technology Shenyang P.R.China 2 School of Management Shenyang University of Technology Shenyang P.R.China

关键词： Target cost goal programming simplex method

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Resource planning and packet forwarding for next-generation multi-hop wireless mesh networks

Resource planning and packet forwarding for next-generation ...

引用

16th international conference on Computer Communications and Networks

作者： Lin, Ting-Yu Fan, Kang-Lun Natl Chiao Tung Univ Dept Commun Engn Hsinchu Taiwan

ISBN: (纸本)9781424412501

Most earlier works in the area of wireless mesh network assume a single interface being equipped in each node. In this paper, we consider the next-generation wireless mesh networks in which each node may be equipped with multiple radio interfaces, each capable of running in one of several modes, one of several channels, and each capable of supporting multiple modulations. For example, from off-the-shelf components, one can easily construct a mesh node with multiple IEEE 802.11a/b/g radio interfaces. Our goal is to address the resource planning and packet forwarding issues in such an environment. the proposed methodology is based on linear programming with network flow principles and radio channel access/interference models. Given a network topology, traffic requirements, and gateway capacities, we show how to allocate network interface cards and their channels to fully utilize channel bandwidths. the results can be used by a wireless Internet service provider to plan their networks under a hardware constraint so as to maximize their profits. To the best of our knowledge, this is the first work addressing resource planning in a wireless mesh network. Our numerical results show significant improvement in terms of aggregate network throughput with moderate network-layer fairness.

关键词： linear programming resource planning routing channel assignment wireless ad hoc network wireless mesh network

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：