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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

956 篇 会议
51 篇 期刊文献
19 册 图书

馆藏范围

1,025 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

853 篇 工学
- 833 篇 计算机科学与技术...
- 495 篇 软件工程
- 41 篇 信息与通信工程
- 27 篇 电气工程
- 17 篇 控制科学与工程
- 8 篇 机械工程
- 7 篇 土木工程
- 6 篇 建筑学
- 6 篇 化学工程与技术
- 5 篇 材料科学与工程（可...
- 5 篇 农业工程
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 4 篇 生物工程
- 3 篇 冶金工程
- 3 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 航空宇航科学与技...
530 篇 理学
- 422 篇 数学
- 274 篇 系统科学
- 18 篇 统计学（可授理学、...
- 10 篇 物理学
- 7 篇 生物学
- 6 篇 化学
62 篇 管理学
- 54 篇 管理科学与工程(可...
- 34 篇 工商管理
- 10 篇 图书情报与档案管...
7 篇 法学
- 7 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 农学
- 5 篇 作物学
1 篇 教育学
1 篇 医学
1 篇 军事学

主题

198 篇 constraint theor...
163 篇 constraint satis...
62 篇 constraint progr...
26 篇 constrained opti...
25 篇 computer program...
23 篇 integer programm...
21 篇 answer set progr...
15 篇 logic programmin...
15 篇 artificial intel...
15 篇 scheduling
14 篇 mathematical log...
14 篇 dynamic programm...
13 篇 problem solving
12 篇 linear programmi...
11 篇 global constrain...
11 篇 programming lang...
11 篇 logics and meani...
10 篇 modeling languag...
9 篇 constraint satis...
9 篇 combinatorial op...

机构

18 篇 natl univ irelan...
18 篇 brown univ provi...
14 篇 univ connecticut...
14 篇 cork constraint ...
10 篇 cork constraint ...
8 篇 univ oxford comp...
7 篇 natl univ irelan...
7 篇 natl univ irelan...
7 篇 department of me...
6 篇 nicta nsw
6 篇 natl univ singap...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 161 rue ada mont...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 univ st andrews ...
5 篇 ben gurion univ ...
5 篇 department of co...
5 篇 univ coll cork c...

作者

31 篇 stuckey peter j.
28 篇 o'sullivan barry
22 篇 van hentenryck p...
20 篇 freuder eugene c...
17 篇 walsh toby
17 篇 quimper claude-g...
15 篇 miguel ian
15 篇 michel laurent
15 篇 bessiere christi...
14 篇 beldiceanu nicol...
14 篇 schaus pierre
14 篇 schulte christia...
12 篇 smith barbara m.
12 篇 hebrard emmanuel
12 篇 pesant gilles
11 篇 régin jean-charl...
11 篇 beck j. christop...
10 篇 hnich brahim
10 篇 gent ian p.
10 篇 rueher michel

语言

1,023 篇 英文
3 篇 中文

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

共 1026 条记录，以下是421-430 订阅

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

详细简洁

排序：

Open constraint programming 4th

引用

4th international conference on principles and practice of constraint programming, CP 1998

作者： Jaffar, Joxan Yap, Roland H. C. Department of Computer Science School of Computing National University of Singapore 119260 Singapore

ISBN: (纸本)3540652248

constraint programming (CP) has proven useful in several areas, and though the initial impetus came from logic programming frameworks like CLP and CCP, the use of CP and constraint solving is obtaining wider appeal. We suggest that the limiting features of traditional CP are a dependence on a (logic) language, the need for mono- tonicity in the constraint system, and, to a lesser extent, the lack of an independent mechanism for agents to specify concurrent interaction with constraint solvers. © Springer-Verlag Berlin Heidelberg 1998.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Towards Practical Infinite Stream constraint programming: Applications and Implementation

Towards Practical Infinite Stream Constraint Programming: Ap...

引用

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

作者： Lee, Jasper C. H. Lee, Jimmy H. M. Univ Cambridge Churchill Coll Cambridge CB2 1TN England Chinese Univ Hong Kong Dept Comp Engn & Sci Sha Tin Peoples R China

ISBN: (纸本)9783319104287;9783319104270

Siu et al. propose stream CSPs (St-CSPs) as a generalisation of finite domain CSPs to cater for constraints on infinite streams, and a solving algorithm that produces a deterministic Buchi automaton recognising the solution language. As a novel application, we demonstrate how St-CSPs can model mathematically and generate a PID controller for driving a self-balancing tray and an inverted pendulum in real-time. We propose and give formally the correctness of an improvement to the implementation that eliminates numerous unnecessary states in the solution automaton for St-CSPs involving the first temporal operator, thereby reducing solving time. We give two St-CSP examples that can benefit from our new implementation techniques. Our approach always generates a solution automaton not bigger than, but potentially exponentially smaller than, that produced by the original implementation. Experimental results show substantial improvements.

关键词： Inverted pendulum

来源：评论

学校读者我要写书评

暂无评论

Training Binarized Neural Networks Using MIP and CP 25th

Training Binarized Neural Networks Using MIP and CP

引用

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

作者： Icarte, Rodrigo Toro Illanes, Leon Castro, Margarita P. Cire, Andre A. McIlraith, Sheila A. Beck, J. Christopher Univ Toronto Dept Comp Sci Toronto ON Canada Vector Inst Toronto ON Canada Univ Toronto Dept Mech & Ind Engn Toronto ON Canada Univ Toronto Scarborough Dept Management Toronto ON Canada

ISBN: (纸本)9783030300487

Binarized Neural Networks (BNNs) are an important class of neural network characterized by weights and activations restricted to the set {-1, +1}. BNNs provide simple compact descriptions and as such have a wide range of applications in low-power devices. In this paper, we investigate a model-based approach to training BNNs using constraint programming (CP), mixed-integer programming (MIP), and CP/MIP hybrids. We formulate the training problem as finding a set of weights that correctly classify the training set instances while optimizing objective functions that have been proposed in the literature as proxies for generalizability. Our experimental results on the MNIST digit recognition dataset suggest that-when training data is limited-the BNNs found by our hybrid approach generalize better than those obtained from a state-of-the-art gradient descent method. More broadly, this work enables the analysis of neural network performance based on the availability of optimal solutions and optimality bounds.

关键词： Binarized Neural Networks Machine learning constraint programming Mixed integer programming Discrete optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Methods for constraint Acquisition 1

引用

24th international conference on the principles and practice of constraint programming (CP)

作者： Tsouros, Dimosthenis C. Stergiou, Kostas Sarigiannidis, Panagiotis G. Univ Western Macedonia Dept Informat & Telecommun Engn Kozani Greece

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

constraint acquisition systems such as QuAcq and MultiAcq can assist non-expert users to model their problems as constraint networks by classifying (partial) examples as positive or negative. For each negative example, the former focuses on one constraint of the target network, while the latter can learn a maximum number of constraints. Two bottlenecks of the acquisition process where both these algorithms encounter problems are the large number of queries required to reach convergence, and the high cpu times needed to generate queries, especially near convergence. We propose methods that deal with both these issues. the first one is an algorithm that blends the main idea of MultiAcq into QuAcq resulting in a method that learns as many constraints as MultiAcq does after a negative example, but with a lower complexity. the second is a technique that helps reduce the number of queries significantly. the third is based on the use of partial queries to cut down the time required for convergence. Experiments demonstrate that our resulting algorithm, which integrates all the new techniques, does not only generate considerably fewer queries than QuAcq and MultiAcq, but it is also by far faster than both of them, both in average query generation time and in total run time.

关键词： constraint acquisition Learning Modeling

来源：评论

学校读者我要写书评

暂无评论

Generating Special-Purpose Stateless Propagators for Arbitrary constraints

Generating Special-Purpose Stateless Propagators for Arbitra...

引用

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

作者： Gent, Ian P. Jefferson, Chris Miguel, Ian Nightingale, Peter Univ St Andrews Sch Comp Sci St Andrews Fife Scotland

ISBN: (纸本)9783642153952

Given an arbitrary constraint a on 71 variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation that would be performed on every reachable subdomain of scope(c). Our propagators are stateless: they store no state between calls, and so incur no overhead in storing and backtracking state during search. the preprocessing step can take exponential time and the custom propagator is potentially exponential in size. However, for small constraints used repeatedly, in one problem or many, this technique can provide substantial practical gains. Our experimental results show that, compared with optimised implementations of the table constraint;this technique can lead to an order of magnitude speedup;while doing identical search on realistic problems. the technique can also be many times faster than a decomposition into primitive constraints in the Minion solver. Propagation is so fast that, for constraints available in our solver, the generated propagator compares well with a human-optimised propagator for the same constraint.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Studying interchangeability in constraint satisfaction problems 8th

引用

8th international conference on principles and practice of constraint programming, CP 2002

作者： Neagu, Nicoleta EcublensCH-1015 Switzerland

ISBN: (纸本)3540441204

Most work in constraint satisfaction has concentrated on computing a solution to a given problem. In practice, it often happens that an existing solution needs to be modified to satisfy additional criteria or changes in the problem. For example, a schedule or plan might have to be adjusted when a resource is missing. the concept of interchangeability characterizes the possibilities for making local changes to CSP solutions. © Springer-Verlag Berlin Heidelberg 2002.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

constraint programming-Based Job Dispatching for Modern HPC Applications 25th

Constraint Programming-Based Job Dispatching for Modern HPC ...

引用

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

作者： Galleguillos, Cristian Kiziltan, Zeynep Sirbu, Alina Babaoglu, Ozalp Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Bologna Bologna Italy Univ Pisa Pisa Italy

ISBN: (纸本)9783030300487

HPC systems are increasingly being used for big data analytics and predictive model building that employ many short jobs. In these application scenarios, HPC job dispatchers need to process large numbers of short jobs quickly and make decisions on-line while ensuring high Quality-of-Service (QoS) levels and meet demanding timing requirements. constraint programming (CP) is an effective approach for tackling job dispatching problems. Yet, the state-of-the-art CP-based job dispatchers are unable to satisfy the challenges of on-line dispatching and take advantage of job duration predictions. these limitations jeopardize achieving high QoS levels, and consequently impede the adoption of CP-based dispatchers in HPC systems. We propose a class of CP-based dispatchers that are more suitable for HPC systems running modern applications. the new dispatchers are able to reduce the time required for generating on-line dispatching decisions significantly, and are able to make effective use of job duration predictions to decrease waiting times and job slowdowns, especially for workloads dominated by short jobs.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

MiniZinc: Towards a standard CP modelling language

MiniZinc: Towards a standard CP modelling language

引用

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

作者： Nethercote, Nicholas Stuckey, Peter J. Becket, Ralph Brand, Sebastian Duck, Gregory J. Tack, Guido Univ Melbourne Natl ICT Australia Melbourne Vic 3010 Australia Saarland Univ Programming Syst Lab Saarbrucken Germany Natl ICT Australia Melbourne Vic Australia

ISBN: (纸本)9783540749691

there is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. this makes it difficult for modellers to experiment with different solvers for a problem. In this paper we present MiniZinc, a simple but expressive CP modelling language which is suitable for modelling problems for a range of solvers and provides a reasonable compromise between many design possibilities. Equally importantly, we also propose a low-level solver-input language called FlatZinc, and a straight forward translation from MiniZinc to FlatZinc that preserves all solver-supported global constraints. this lets a solver writer support MiniZinc with a minimum of effort-they only need to provide a simple FlatZinc front-end to their solver, and then combine it with an existing MiniZinc-to-FlatZinc translator. Such a front-end may then serve as a stepping stone towards a full MiniZine implementation that;is more tailored to the particular solver. A standard language for modelling CP problems will encourage experimentation with and comparisons between different solvers. Although MiniZinc is not perfect-no standard modelling language will be-we believe its simplicity, expressiveness, and case of implementation make it a practical choice for a standard language.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Maintaining State in Propagation Solvers

Maintaining State in Propagation Solvers

引用

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

作者： Reischuk, Raphael M. Schulte, Christian Stuckey, Peter J. Tack, Guido Univ Saarland IS&C D-6600 Saarbrucken Germany KTH Royal Inst Technol Stockholm Sweden Univ Melbourne Natl ICT Australia Dept Comp Sci & Software Engn Victoria Lab Melbourne Vic Australia Univ Saarland PS Lab Saarbrucken Germany

ISBN: (纸本)9783642042430

constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. the solver state is modified during propagation. But search requires the solver to return to a previous state. Hence a, propagation solver must determine how to maintain state during propagation and forward and backward search. this paper sets out the possible ways in which a propagation solver call choose to maintain state, and the restrictions that such choices place on the resulting system. Experiments illustrate the result of various choices for the three principle state components of a solver: variables, propagators, and dependencies between them. this paper also provides the first realistic comparison of trailing versus copying for state restoration.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming - CP 2002 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Pascal Hentenryck

ISBN: (数字)9783540461357

ISBN: (纸本)9783540441205

this book constitutes the refereed proceedings of the 8th international conference on principles and practice of constraint programming, CP 2002, held in Ithaca, NY, USA in September 2002.;the 38 revised full papers and 6 innovative application papers as well as the 14 short papers presented toghether with 25 abstracts from contributions to the doctoral program were carefully reviewed and selected from 146 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to application in various fields.

关键词： Software Engineering/programming and Operating Systems programming Techniques programming Languages, Compilers, Interpreters Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共103页 << < 39 40 41 42 43 44 45 46 47 48 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：