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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A constraint store based on multivalued decision diagrams

A constraint store based on multivalued decision diagrams

引用

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

作者： Andersen, H. R. Hadzic, T. Hooker, J. N. Tiedemann, P. IT Univ Copenhagen Copenhagen Denmark Carnegie Mellon Univ Pittsburgh PA USA

ISBN: (纸本)9783540749691

the typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-width multivalued decision diagram (MDD). It reduces to a traditional domain store when the maximum width is one but allows greater pruning of the search tree for larger widths. MDD propagation algorithms can be developed to exploit the structure of particular constraints, much as is done for domain filtering algorithms. We propose specialized propagation algorithms for alldiff and inequality constraints. Preliminary experiments show that MDD propagation solves multiple alldiff problems an order of magnitude more rapidly than traditional domain propagation. It also significantly reduces the search tree for inequality problems, but additional research is needed to reduce the computation time.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

HIBISCUS: A constraint programming application to staff scheduling in health care

引用

9th international conference on principles and practice of constraint programming

作者： Bourdais, S Galinier, P Pesant, G Ecole Polytech Dept Genie Informat Montreal PQ H3C 3A7 Canada

ISBN: (纸本)3540202021

this paper presents a constraint programming model and search strategy to formulate and solve staff scheduling problems in health care. this is a well-studied problem for which many different approaches have been developed over the years but it remains a challenge to successfully apply any given instance of a method to the various contexts encountered. We show how the main categories of rules involved may be expressed using global constraints. We describe a modular architecture for heuristic search. the resulting flexible and rather general constraint programming approach is evaluated on benchmark problems from different hospitals and for different types of personnel.

关键词： Health care

来源：评论

学校读者我要写书评

暂无评论

Reducing Bias in Preference Aggregation for Multiagent Soft constraint Problems 25th

Reducing Bias in Preference Aggregation for Multiagent Soft ...

引用

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

作者： Schiendorfer, Alexander Reif, Wolfgang Univ Augsburg Inst Software & Syst Engn Augsburg Germany

ISBN: (纸本)9783030300487

Most distributed constraint optimization problems assume the overall objective function to be the "utilitarian social welfare", i.e., a sum of several utility functions, belonging to different agents. this also holds for the most popular soft constraint formalisms, cost function networks and weighted constraints. While, in theory, this model is sound, it is susceptible to manipulation and resulting bias in practice. Even without malevolent intentions, bias can result from the way orderings over solutions are transformed into numerical values or normalized. Alternatively, preferences can be aggregated directly using the tools of social choice theory to discourage manipulations and practically reduce unwanted bias. Several common voting functions can be implemented on top of constraint modeling languages through incremental search and suitable improvement predicates. We demonstrate that our approach, in particular Condorcet voting, can undo bias which is shown on two real-life-inspired case studies using the soft constraint extension MiniBrass on top of MiniZinc.

关键词： Soft constraints Distributed constraint optimization Social choice Modeling languages MiniZinc

来源：评论

学校读者我要写书评

暂无评论

Reward Potentials for Planning with Learned Neural Network Transition Models 25th

Reward Potentials for Planning with Learned Neural Network T...

引用

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

作者： Say, Buser Sanner, Scott thiebaux, Sylvie Univ Toronto Toronto ON Canada Vector Inst Toronto ON Canada Australian Natl Univ Canberra ACT Australia

ISBN: (纸本)9783030300487

Optimal planning with respect to learned neural network (NN) models in continuous action and state spaces using mixed-integer linear programming (MILP) is a challenging task for branch-and-bound solvers due to the poor linear relaxation of the underlying MILP model. For a given set of features, potential heuristics provide an efficient framework for computing bounds on cost (reward) functions. In this paper, we model the problem of finding optimal potential bounds for learned NN models as a bilevel program, and solve it using a novel finite-time constraint generation algorithm. We then strengthen the linear relaxation of the underlying MILP model by introducing constraints to bound the reward function based on the precomputed reward potentials. Experimentally, we show that our algorithm efficiently computes reward potentials for learned NN models, and that the overhead of computing reward potentials is justified by the overall strengthening of the underlying MILP model for the task of planning over long horizons.

关键词： Neural networks Potential heuristics Planning constraint generation

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： thomas Schiex Simon de Givry

this book constitutes the proceedings of the 25th international conference on principles and practice of constraint programming, cp 2019, held in Stamford, CT, USA, France, in September/October 2019.

ISBN: (数字)9783030300487

ISBN: (纸本)9783030300470

this book constitutes the proceedings of the 25th international conference on principles and practice of constraint programming, cp 2019, held in Stamford, CT, USA, France, in September/October 2019.

关键词： Mathematical Logic and Formal Languages Mathematics of Computing Artificial Intelligence Software Engineering/programming and Operating Systems Arithmetic and Logic Structures

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming – cp 2007 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540749707

ISBN: (纸本)9783540749691

the 13th international conference on principles and practice of constraint programming (cp 2007) was held in Providence, RI, USA, September 23–27, 2007, in conjunction with the international conference on Automated Pl- ning and Scheduling (ICAPS). Held annually, the cp conference series is the premier international conference on constraint programming. the conference focuses on all aspects of computing with constraints. the cp conference - ries is organized by the Association for constraint programming (Acp). - formation about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about Acp can be found athttp://www. a4cp. org/. cp 2007 launched two calls for contributions: a call for research papers, describing novel contributions in the ?eld, and a call for application papers, describing applications of constraint technology in the industrial world. the research track received 143 submissions and the application track received 22 submissions. Research papers were reviewed under a double-blind scheme. they received three reviews that the authors had the opportunity to see and to react tobeforethepapersandtheirreviewswerediscussedextensivelybythemembers of the ProgramCommittee. Application papers werereviewedby a separate- plication Committee. the Program Committee and the Application Committee then selected 43 researchpapers and 9 application papers to be published in full inthe proceedings,andanadditional14researchpapersto be publishedas short papers. the full papers were presented at the conference in two parallel tracks and the short papers were presented in a poster session.

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

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Inter-Level Forward-Checking for DisCSPs

Asynchronous Inter-Level Forward-Checking for DisCSPs

引用

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

作者： Ezzahir, Redouane Bessiere, Christian Wahbi, Mohamed Benelallam, Imade Bouyakhf, El Houssine U Montpellier 2 LIRMM CNRS Montpellier France Univ Mohammed V Agdal LIMIARF FSRU Rabat Morocco

ISBN: (纸本)9783642042430

We propose two new asynchronous algorithms for solving Distributed constraint Satisfaction Problems (DisCSPs). the first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). the second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based oil the AFC-ng algorithm and is performed oil a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC only need polynomial space. We compare the performance of these algorithms with other DisCSP algorithms on random DisCSPs in two kinds of communication environments: Fast communication and slow communication. Our experiment,, show that AFC-ng improves oil AFC and that AILFC Outperforms all compared algorithms in communication load.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Closing the Open Shop: Contradicting Conventional Wisdom

Closing the Open Shop: Contradicting Conventional Wisdom

引用

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

作者： Grimes, Diarmuid Hebrard, Emmanuel Malapert, Arnaud Cork Constraint Computat Ctr Cork Ireland Cirrelt CNRS EMN LINA UMR 6241 Montreal PQ Canada

ISBN: (纸本)9783642042430

this paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused oil developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such domain specific models. We introduce a simple constraint model that combines a generic adaptive heuristic with naive propagation, and show that it often outperforms state-of-the-art solvers for both open shop and job shop problems.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Fast optimal instruction scheduling for single-issue processors with arbitrary latencies 7

引用

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

作者： Van Beek, Peter Wilken, Kent Department of Computer Science University of Waterloo WaterlooONN2L 3G1 Canada Department of Electrical and Computer Engineering University of California DavisCA95616 United States

ISBN: (纸本)3540428631

Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. the local instruction scheduling problem is to find a minimum length instruction schedule for a basic block subject to precedence, latency, and resource constraints. In this paper we consider local instruction scheduling for single-issue processors with arbitrary latencies. the problem is considered intractable, and heuristic approaches are currently used in production compilers. In contrast, we present a relatively simple approach to instruction scheduling based on constraint programming which is fast and optimal. the proposed approach uses an improved constraint model which allows it to scale up to very large, real problems. We describe powerful redundant constraints that allow a standard constraint solver to solve these scheduling problems in an almost backtrack-free manner. the redundant constraints are lower bounds on selected subproblems which take advantage of the structure inherent in the problems. Under specified conditions, these constraints are sometimes further improved by testing the consistency of a sub-problem using a fast test. We experimentally evaluated our approach by integrating it into the Gnu Compiler Collection (GCC) and then applying it to the SPEC95 floating point benchmarks. All 7402 of the benchmarks’ basic-blocks were optimally scheduled, including basic-blocks with up to 1000 instructions. Our results compare favorably to the best previous approach which is based on integer linear programming (Wilken et al., 2000): Across the same benchmarks, the total optimal scheduling time for their approach is 98 seconds while the total time for our approach is less than 5 seconds. © Springer-Verlag Berlin Heidelberg 2001.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Efficient Generic Search Heuristics within the EMBP Framework

Efficient Generic Search Heuristics within the EMBP Framewor...

引用

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

作者： Le Bras, Ronan Zanarini, Alessandro Pesant, Gilles Ecole Polytech Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9783642042430

Accurately estimating the distribution of solutions to a problem, should such solutions exist, provides efficient search heuristics. the purpose of this paper is to propose new ways of computing such estimates, with different degrees of accuracy and complexity. We build oil the Expectation-Maximizatiou Belief-Propagation (EMPB) framework proposed by Hsu et al. to solve constraint Satisfaction Problems (CSPs). We propose two general approaches within the EMBP framework: we firstly derive update rules at;the constraint level while enforcing domain consistency and then derive update rules globally, at the problem level. the contribution of this paper is two-fold: first, we derive new generic update rules suited to tackle ally CSP;second, we propose all efficient EMP-inspired approach, thereby improving this method and making it competitive with the state of the art. We evaluate these approaches experimentally and demonstrate their effectiveness.

关键词： constraint Satisfaction Search Heuristics Probabilistic Reasoning Expectation Maximization Belief Propagation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：