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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Pin Assignment Using Stochastic Local Search constraint programming

Pin Assignment Using Stochastic Local Search Constraint Prog...

引用

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

作者： Dubrov, Bella Eran, Haggai Freund, Ari Mark, Edward F. Ramji, Shyam Schell, Timothy A. IBM Haifa Res Lab Haifa Israel IBM East Fishkill Hopewell Jct NY USA

ISBN: (纸本)9783642042430

VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated is constraint problems and are potentially amenable to cp techniques. To the best of our knowledge, though there has been little cp work in this domain to date. We describe a successful application of a cp based tool to a particular pin-assignment problem hi which tens of thousands of phis (i.e.;connection points) belonging to internal units on the chip must be placed within their units so as to satisfy certain constraints and optimize the wirability of the design. Our tool has been tested on read IBM designs and is now being integrated into IBM's chip development environment.

关键词： constraint programming Stochastic Local Search EDA ASIC Chip Design Pin Assignment

来源：评论

学校读者我要写书评

暂无评论

Weakly Monotonic Propagators

Weakly Monotonic Propagators

引用

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

作者： Schulte, Christian Tack, Guido KTH Royal Inst Technol Stockholm Sweden Univ Saarland Programming Syst Lab Saarbrucken Germany

ISBN: (纸本)9783642042430

Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. these models do not comply with reality: today's constraint, programming systems actually use non-monotonic propagators. this paper introduces the first realistic model of constraint propagation by assuming it propagator to be weakly monotonic (complying with the constraint it implements). Weak monotonicity is shown to be the minimal property that guarantees constraint propagation to be sound and complete. the important insight is that weak monotonicity makes propagation in combination. with search well behaved. A case study suggests that non-monotonicity call be seen as all opportunity for more efficient propagation.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Scheduling of Mobile Robots Using constraint programming 25th

Scheduling of Mobile Robots Using Constraint Programming

引用

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

作者： Murin, Stanislav Rudova, Hana Masaryk Univ Fac Informat Brno Czech Republic

ISBN: (纸本)9783030300487

Mobile robots in flexible manufacturing systems can transport components for jobs between machines as well as process jobs on selected machines. While the job shop problem with transportation resources allows encapsulating of transportation, this work concentrates on the extended version of the problem, including the processing by mobile robots. We propose a novel constraint programming model for this problem where the crucial part of the model lies in a proper inclusion of the transportation. We have implemented it in the Optimization programming Language using the cp Optimizer, and compare it with the existing mixed integer programming solver. While both approaches are capable of solving the problem optimally, a new constraint programming approach works more efficiently, and it can compute solutions in more than an order of magnitude faster. Given that, the results of more realistic data instances are delivered in real-time, which is very important in a smart factory.

关键词： Scheduling constraint programming Mobile robot Flexible manufacturing system Transportation IBM ILOG cpLEX Optimization Studio

来源：评论

学校读者我要写书评

暂无评论

Compiling Conditional constraints 25th

Compiling Conditional Constraints

引用

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

作者： Stuckey, Peter J. Tack, Guido Monash Univ Melbourne Vic Australia CSIRO Data61 Melbourne Vic Australia

ISBN: (纸本)9783030300487

Conditionals are a core concept in all programming languages. they are also a natural and powerful mechanism for expressing complex constraints in constraint modelling languages. the behaviour of conditionals is complicated by undefinedness. In this paper we show how to most effectively translate conditional constraints for underlying solvers. We show that the simple translation into implications can be improved, at least in terms of reasoning strength, for both constraint programming and mixed integer programming solvers. Unit testing shows that the new translations are more efficient, but the benefits are not so clear on full models where the interaction with other features such as learning is more complicated.

关键词： constraint modelling Conditional constraints MiniZinc

来源：评论

学校读者我要写书评

暂无评论

Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint 7

引用

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

作者： Beldiceanu, Nicolas Carlsson, Mats SICS Lägerhyddsv. 18 UppsalaSE-752 37 Sweden

ISBN: (纸本)3540428631

We first present a generic pruning technique which aggregates several constraints sharing some variables. the method is derived from an idea called sweep which is extensively used in computational geometry. A first benefit of this technique comes from the fact that it can be applied to several families of global constraints. A second advantage is that it does not lead to any memory consumption problem since it only requires temporary memory which can be reclaimed after each invocation of the method. We then specialize this technique to the non-overlapping rectangles constraint, describe several optimizations, and give an empirical evaluation based on six sets of test instances with different characteristics. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

A filtering algorithm for the stretch constraint 1

引用

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

作者： Pesant, Gilles Centre for Research on Transportation Université de Montréal C.P. 6128 succ. Centre-ville MontrealH3C 3J7 Canada École Polytechnique de Montréal Montreal Canada

ISBN: (数字)9783540455783

ISBN: (纸本)3540428631

this paper describes a filtering algorithm for a type of constraint that often arises in rostering problems but that also has wider application. Defined on a sequence of variables, the stretch constraint restricts the number of consecutive identical values in the sequence. the algorithm mainly proceeds by determining intervals in which a given stretch must lie and then reasoning about them to filter out values. It is shown to have low time complexity and significant pruning capability as evidenced by experimental results. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Encoding Linear constraints into SAT

Encoding Linear Constraints into SAT

引用

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

作者： Abio, Ignasi Stuckey, Peter J. NICTA Victoria Lab Melbourne Vic Australia

ISBN: (纸本)9783319104287;9783319104270

Linear integer constraints are one of the most important constraints in combinatorial problems since they are commonly found in many practical applications. Typically, encoding linear constraints to SAT performs poorly in problems with these constraints in comparison to constraint programming (cp) or mixed integer programming (MIP) solvers. But some problems contain a mix of combinatoric constraints and linear constraints, where encoding to SAT is highly effective. In this paper we define new approaches to encoding linear constraints into SAT, by extending encoding methods for pseudo-Boolean constraints. Experimental results show that these methods are not only better than the state-of-the-art SAT encodings, but also improve on MIP and cp solvers on appropriate problems. Combining the new encoding with lazy decomposition, which during runtime only encodes constraints that are important to the solving process that occurs, gives a robust approach to many highly combinatorial problems involving linear constraints.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Generic constraint-Based Block Modeling Using constraint programming 25th

Generic Constraint-Based Block Modeling Using Constraint Pro...

引用

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

作者： Mattenet, Alex Davidson, Ian Nijssen, Siegfried Schaus, Pierre UCLouvain ICTEAM Ottignies Belgium Univ Calif Davis Comp Sci Dept Davis CA 95616 USA

ISBN: (纸本)9783030300487

Block modeling has been used extensively in many domains including social science, spatial temporal data analysis and even medical imaging. Original formulations of the problem modeled the problem as a mixed integer programming problem, but were not scalable. Subsequent work relaxed the discrete optimization requirement, and showed that adding constraints is not straightforward in existing approaches. In this work, we present a new approach based on constraint programming, allowing discrete optimization of block modeling in a manner that is not only scalable, but also allows the easy incorporation of constraints. We introduce a new constraint filtering algorithm that outperforms earlier approaches, in both constrained and unconstrained settings. We show its use in the analysis of real datasets.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Exploring Declarative Local-Search Neighbourhoods with constraint programming 25th

Exploring Declarative Local-Search Neighbourhoods with Const...

引用

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

作者： Bjordal, Gustav Flener, Pierre Pearson, Justin Stuckey, Peter J. Uppsala Univ Dept Informat Technol Uppsala Sweden Monash Univ Fac Informat Technol Melbourne Vic Australia

ISBN: (纸本)9783030300487

Using constraint programming (cp) to explore a local-search neighbourhood was first tried in the mid 1990s. the advantage is that constraint propagation can quickly rule out uninteresting neighbours, sometimes greatly reducing the number actually probed. However, a cp model of the neighbourhood has to be handcrafted from the model of the problem: this can be difficult and tedious. that research direction appears abandoned since large-neighbourhood search (LNS) and constraint-based local search (CBLS) arose as alternatives that seem easier to use. Recently, the notion of declarative neighbourhood was added to the technology-independent modelling language MiniZinc, for use by any backend to MiniZinc, but currently only used by a CBLS backend. We demonstrate that declarative neighbourhoods are indeed technology-independent by using the old idea of cp-based neighbourhood exploration: we explain how to encode automatically a declarative neighbourhood into a cp model of the neighbourhood. this enables us to lift any cp solver into a local-search backend to MiniZinc. Our prototype is competitive with cp, CBLS, and LNS backends to MiniZinc.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

constraint-based temporal reasoning for e-learning with LODE

Constraint-based temporal reasoning for e-learning with LODE

引用

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

作者： Gennari, Rosella Mich, Ornella Free Univ Bozen Bolzano CS Fac KRDB I-39100 Bolzano Italy

ISBN: (纸本)9783540749691

LODE is a logic-based web tool for Italian deaf children. It aims at stimulating global reasoning on e-stories written in a verbal language. Presently, we are focusing on temporal reasoning, that is, LODE stimulates children to reason with global temporal relations between events possibly distant in a story. this is done through apt exercises and with the support of a constraint programming system. Children can also reinvent the e-story by rearranging its events along a new temporal order;it is the task of the constraint system to determine the consistency of the temporally reorganised story and provide children with feedback. To the best of our knowledge, LODE is the first e-learning tool for Italian deaf children that aims at stimulating global reasoning on whole e-stories.

关键词： constraint programming automated temporal reasoning e-learning assistive technology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：