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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

309 篇 会议
8 册 图书
6 篇 期刊文献

馆藏范围

322 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

274 篇 工学
- 267 篇 计算机科学与技术...
- 165 篇 软件工程
- 27 篇 信息与通信工程
- 19 篇 电气工程
- 4 篇 化学工程与技术
- 3 篇 动力工程及工程热...
- 3 篇 土木工程
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 石油与天然气工程
192 篇 理学
- 143 篇 数学
- 116 篇 系统科学
- 7 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 化学
- 3 篇 生物学
- 1 篇 地球物理学
24 篇 管理学
- 22 篇 管理科学与工程(可...
- 15 篇 工商管理
- 3 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

64 篇 constraint theor...
52 篇 constraint satis...
31 篇 constraint progr...
11 篇 constrained opti...
8 篇 problem solving
7 篇 scheduling
6 篇 mathematical log...
5 篇 artificial intel...
4 篇 modeling languag...
4 篇 model checking
4 篇 optimization
4 篇 programming lang...
4 篇 logics and meani...
3 篇 polynomial appro...
3 篇 constraint handl...
3 篇 semantics
3 篇 algorithm analys...
3 篇 regular constrai...
2 篇 solution countin...
2 篇 software enginee...

机构

5 篇 cork constraint ...
5 篇 cork constraint ...
4 篇 ecole polytech m...
4 篇 fraunhofer first...
4 篇 natl univ irelan...
4 篇 kth royal inst t...
4 篇 mines de nantes
4 篇 brown univ provi...
3 篇 univ bologna dei...
3 篇 nicta nsw
3 篇 university of co...
3 篇 161 rue ada mont...
3 篇 iiia-csic campus...
3 篇 univ connecticut...
3 篇 natl univ irelan...
3 篇 univ coll cork c...
3 篇 univ london impe...
3 篇 univ toronto dep...
2 篇 lund university ...
2 篇 university of pa...

作者

16 篇 stuckey peter j.
11 篇 o'sullivan barry
9 篇 bessiere christi...
8 篇 miguel ian
8 篇 beldiceanu nicol...
8 篇 hebrard emmanuel
8 篇 pesant gilles
7 篇 van hentenryck p...
7 篇 walsh toby
7 篇 schulte christia...
7 篇 quimper claude-g...
6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 choueiry berthe ...
6 篇 simonis helmut
6 篇 schaus pierre
5 篇 rousseau louis-m...
5 篇 hnich brahim
5 篇 deville yves
5 篇 bessière christi...

语言

322 篇 英文
1 篇 中文

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

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

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

详细简洁

排序：

A constraint programming approach to the stable marriage problem 1

引用

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

作者： Gent, Ian P Irving, Robert W Manlove, David F Prosser, Patrick Smith, Barbara M School of Computer Science University of St. Andrews United Kingdom Department of Computing Science University of Glasgow United Kingdom School of Computing and Mathematics University of Huddersfield United Kingdom

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

the Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a constraint Satisfaction Problem. We prove that, in a precise sense, establishing arc consistency in J is equivalent to the action of the established Extended Gale/Shapley algorithm for SM on I. As a consequence of this, the man-optimal and woman-optimal stable matchings can be derived immediately. Furthermore we show that, in both encodings, all solutions of I may be enumerated in a failure-free manner. Our results indicate the applicability of constraint programming to the domain of stable matching problems in general, many of which are NP-hard. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Domain Views for constraint programming

Domain Views for Constraint Programming

引用

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

作者： Van Hentenryck, Pascal Michel, Laurent NICTA Australia Providence RI 02912 USA Univ Connecticut Storrs CT 06269 USA

ISBN: (纸本)9783319104287;9783319104270

Traditional constraint-programming systems provide the concept of variable views which implement a view of the type y = f(x) by delegating operations on variable y to variable x. While the traditional support is limited to bound consistency, this paper offers views that support domain consistency without any limitations. this paper proposes the alternative concept of domain views which delegate all domain operations. Domain views preserve the benefits of variable views, simplify the implementation of value-based propagation, and also support noninjective views compositionally. Experimental results demonstrate the practical benefits of domain views. the paper also reveals a subtle interaction between views and the exploitation of constraint idempotence, which may lead to incomplete propagation.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Dealing with incomplete preferences in soft constraint problems

Dealing with incomplete preferences in soft constraint probl...

引用

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

作者： Gelain, Mirco Pini, Maria Silvia Rossi, Francesca Venable, K. Brent Univ Padua Dipartimento Matemat Pura & Applicata I-35100 Padua Italy

ISBN: (纸本)9783540749691

We consider soft constraint problems where some of the preferences may be unspecified. this models, for example, situations with several agents providing the data, or with possible privacy issues. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define an algorithm to find a solution which is necessarily optimal, that is, optimal no matter what the missing data will be, with the aim to ask the user to reveal as few preferences as possible. Experimental results show that in many cases a necessarily optimal solution can be found without eliciting too many preferences.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

the StockingCost constraint

The StockingCost Constraint

引用

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

作者： Houndji, Vinasetan Ratheil Schaus, Pierre Wolsey, Laurence Deville, Yves Catholic Univ Louvain Louvain La Neuve Belgium

ISBN: (纸本)9783319104287;9783319104270

Many production planning problems call for the minimization of stocking/storage costs. this paper introduces a new global constraint StockingCost ([X-1,..., X-n], [d(1),..., d(n)], H, c) that holds when each item X-i is produced on or before its due date d(i), the capacity c of the machine is respected, and H is an upper bound on the stocking cost. We propose a linear time algorithm to achieve bound consistency on the StockingCost constraint. On a version of the Discrete Lot Sizing Problem, we demonstrate experimentally the pruning and time efficiency of our algorithm compared to other state-of-the-art approaches.

关键词： Production Planning Discrete Lot Sizing constraint programming Global constraint

来源：评论

学校读者我要写书评

暂无评论

Hybrid benders decomposition algorithms in constraint logic programming

引用

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

作者： Eremin, Andrew Wallace, Mark IC-Parc London United Kingdom

ISBN: (纸本)3540428631

Benders Decomposition is a form of hybridisation that allows linear programming to be combined with other kinds of algorithms. It extracts new constraints for one subproblem from the dual values of the other subproblem. this paper describes an implementation of Benders Decomposition, in the ECLiPSe language, that enables it to be used within a constraint programming framework. the programmer is spared from having to write down the dual form of any subproblem, because it is derived by the system. Examples are used to show how problem constraints can be modelled in an undecomposed form. the programmer need only specify which variables belong to which subproblems, and the Benders Decomposition is extracted automatically. A class of minimal perturbation problems is used to illustrate how different kinds of algorithms can be used for the different subproblems. the implementation is tested on a set of minimal perturbation benchmarks, and the results are analysed. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Case Study: constraint programming in a System Level Synthesis Framework

Case Study: Constraint Programming in a System Level Synthes...

引用

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

作者： Li, Shuo Hemani, Ahmed Royal Inst Technol Sch Informat & Commun Technol Dept Elect Syst S-16440 Stockholm Sweden

ISBN: (纸本)9783319104287;9783319104270

this article presents a case study of using a constraint programming solver in a system level synthesis framework called SYLVA. the solver is used to find the repetition vector of a synchronous data flow graph and serving as the design space exploration engine, which rapidly finds qualified system implementations by solving a constraint satisfaction optimization problem. Each system implementation is a combination of a number of function implementation instances and their cycle accurate execution schedules. the problem to be solved is automatically generated based on the user inputs: 1) a system model to be synthesized, 2) a library containing all the usable function implementations, 3) the performance/cost constraints, and 4) the optimization objectives. Use of constraints programming technique enabled a low cost development of design space exploration engine in addition to gaining ease of use.

关键词： System Level Synthesis Design Space Exploration constraint programming

来源：评论

学校读者我要写书评

暂无评论

Cost-Driven Interactive CSP with constraint Relaxation

Cost-Driven Interactive CSP with Constraint Relaxation

引用

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

作者： Schreiber, Yevgeny Intel Corp Haifa Israel

ISBN: (纸本)9783642042430

We revisit the Interactive CSP framework (ICSP) and propose a, new: somewhat more general model, which we call Cost-Driven Interactive CSP (CICSP). First, we extend the value acquisition by a more general concept of constraint relaxation. Second, we loosen the basic assumption of ICSP that "value acquisition is expensive" by introducing external cost functions of the constraint relaxation and the constraint propagation effort. We also propose a general INTERACTIVE RELAXATION algorithm template that. is designated for CICSP. the effectiveness of this approach is illustrated oil a real-life scenario from the Functional Test Generation problem domain.

关键词： Functional Test Generation constraint Relaxation Cost-Driven Interactive CSP ICSP

来源：评论

学校读者我要写书评

暂无评论

constraint techniques for solving the protein structure prediction problem 4th

Constraint techniques for solving the protein structure pred...

引用

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

作者： Backofen, R LMU Munchen Inst Informat D-80538 Munich Germany

ISBN: (纸本)3540652248

the protein structure prediction problem is one of the most (if not the most) important problem in computational biology. this problem consists of finding the conformation of a protein (i.e., a sequence of amino-acids) with minimal energy. Because of the complexity of this problem, simplified models like Dill's HP-lattice model [12] have become a major tool for investigating general properties of protein folding. Even for this simplified model, the structure prediction problem has been shown to be NP-complete [3, 5]. We describe a constraint formulation of the HP-model structure prediction problem, present the basic constraints and search strategy. We then introduce a novel, general technique for excluding geometrical symmetries in constraint programming. To our knowledge, this is the first general and declarative technique for excluding symmetries in constraint programming that can be added to an existing implementation. Finally, we describe a new lower bound on the energy of an HP-protein. Both techniques yield an efficient pruning of the search tree.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

A constraint on the Number of Distinct Vectors with Application to Localization

A Constraint on the Number of Distinct Vectors with Applicat...

引用

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

作者： Chabert, Gilles Jaulin, Luc Lorca, Xavier CNRS LINA Ecole Mines Nantes UMR 6241 4 Rue Alfred Kastler F-44300 Nantes France ENSIETA F-29806 Brest 9 France

ISBN: (纸本)9783642042430

this paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables. the generalized constraint (called nvector) bounds the number of distinct;vectors. the first contribution of this paper is to show that this global constraint has a significant role to play with continuous domains, by taking the example of simultaneous localization and map building (SLAM). this type of problem arises in the context, of mobile robotics. the second contribution is, to prove that enforcing bound consistency on this constraint is NP-complete. A simple contractor (or propagator) is proposed and applied on a real application.

关键词： Robotics

来源：评论

学校读者我要写书评

暂无评论

An application of constraint programming to generating detailed operations schedules for steel manufacturing

An application of constraint programming to generating detai...

引用

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

作者： Davenport, Andrew Kalagnanam, Jayant Reddy, Chandra Siegel, Stuart Hou, John IBM Corp TJ Watson Res Ctr 1101 Kitchawan Rd Yorktown Hts NY 10598 USA IBM Corp Taiwan Business Consulting Serv Taipei Taiwan

ISBN: (纸本)9783540749691

We present an over-view of a system developed by IBM for generating short-term operations schedules for a large steel manufacturer. the problem addressed by the system was challenging due to the combination of detailed resource allocation and scheduling constraints and preferences, sequence dependent setup times, tight minimum and maximum inventory level constraints between processes, and constraints on the minimum and maximum levels of production by shift for each product croup. We have developed a domain-specific decomposition based approach that uses mixed-integer programming to generate a high-level plan for production, and constraint programming to generate a schedule at fine level of time granularity taking into account detailed scheduling constraints and preferences. In this paper we give an overview of the problem domain and solution approach, and present a detailed description of the constraint programming part of the system. We also discuss the impact the system is having with the customer on their manufacturing operations.

关键词： Iron and steel plants

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：