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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78 篇 会议
4 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

66 篇 工学
- 63 篇 计算机科学与技术...
- 43 篇 软件工程
- 9 篇 信息与通信工程
- 4 篇 电气工程
- 1 篇 力学（可授工学、理...
- 1 篇 交通运输工程
44 篇 理学
- 37 篇 数学
- 28 篇 系统科学
- 2 篇 物理学
- 1 篇 统计学（可授理学、...
4 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 2 篇 图书情报与档案管...

主题

28 篇 constraint satis...
10 篇 constraint theor...
7 篇 constraint progr...
4 篇 constraint progr...
3 篇 problem solving
3 篇 computer program...
3 篇 congresses.
2 篇 constraint proce...
2 篇 constraint answe...
2 篇 logic programmin...
2 篇 theory solving
2 篇 answer set progr...
1 篇 constraint logic...
1 篇 tractability
1 篇 value merging
1 篇 dynamical system...
1 篇 human computer i...
1 篇 constraint satis...
1 篇 containers
1 篇 computational ge...

机构

5 篇 161 rue ada mont...
3 篇 ilog 1681 route ...
2 篇 univ potsdam pot...
2 篇 aalto univ aalto
2 篇 inria rennes ren...
2 篇 lirmm umr 5506 c...
2 篇 iiia-csic campus...
2 篇 monash universit...
2 篇 cwi p.o. box 940...
2 篇 linkoping univ d...
2 篇 university of am...
2 篇 department of co...
2 篇 kobe university ...
2 篇 brown univ provi...
2 篇 cork constraint ...
1 篇 new mexico state...
1 篇 ligm ecole des p...
1 篇 free univ amster...
1 篇 ntt commun sci l...
1 篇 university of ne...

作者

6 篇 bessière christi...
4 篇 freuder eugene c...
3 篇 apt krzysztof r.
3 篇 miguel ian
3 篇 schaub torsten
2 篇 kaminski roland
2 篇 jonsson p
2 篇 ostrowski max
2 篇 schellhorn sebas...
2 篇 wanko philipp
2 篇 hirayama katsuto...
2 篇 peter j. stuckey
2 篇 frisch alan m.
2 篇 petit thierry
2 篇 meseguer pedro
2 篇 janhunen tomi
2 篇 monfroy eric
2 篇 o’sullivan barry
2 篇 yokoo makoto
2 篇 puget jean-franç...

语言

80 篇 英文
3 篇 中文

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

共 83 条记录，以下是11-20 订阅

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

详细简洁

排序：

Automated Symmetry Breaking and Model Selection in CONJURE

Automated Symmetry Breaking and Model Selection in CONJURE

引用

19th Annual international conference on principles and practice of constraint programming (cp)

作者： Akgun, Ozgur Frisch, Alan M. Gent, Ian P. Hussain, Bilal Syed Jefferson, Christopher Kotthoff, Lars Miguel, Ian Nightingale, Peter Univ St Andrews St Andrews KY16 9AJ Fife Scotland Univ York York YO10 5DD N Yorkshire England Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)9783642406263;9783642406270

constraint modelling is widely recognised as a key bottleneck in applying constraint solving to a problem of interest. the CONJURE automated constraint modelling system addresses this problem by automatically refining constraint models from problem specifications written in the ESSENCE language. ESSENCE provides familiar mathematical concepts like sets, functions and relations nested to any depth. To date, CONJURE has been able to produce a set of alternative model kernels (i.e. without advanced features such as symmetry breaking or implied constraints) for a given specification. the first contribution of this paper is a method by which CONJURE can break symmetry in a model as it is introduced by the modelling process. this works at the problem class level, rather than just individual instances, and does not require an expensive detection step after the model has been formulated. this allows CONJURE to produce a higher quality set of models. A further limitation of CONJURE has been the lack of a mechanism to select among the models it produces. the second contribution of this paper is to present two such mechanisms, allowing effective models to be chosen automatically.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

constraint programming and a usability quest

Constraint programming and a usability quest

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Michel, Laurent D. University of Connecticut Storrs CT 06269-2155 United States

ISBN: (纸本)9783642335570

In 2004, Jean-Francois Puget presented [2] an analysis of the "simplicity of Use" of constraint programming from which he articulated a series of challenges to make constraint programming systems accessible and easier to use. the core of the argument was a contrast between mathematical programming and constraint programming tools. Mathematical programming adopts a model and run paradigm, rely on a simple vocabulary to model problems (i.e., linear constraints), support standard formats for sharing models and benefit from extensive documentation on how to model [5]. constraint programming features a model and search paradigm, rich modeling languages with combinatorial objects and has a distinctive flavor of programming. While it can be construed as cp's Achilles' heel, it is also its most potent strength and is supported by modeling aids [3,4]. the very existence of sophisticated parameter tuning solutions for SAT solvers and Math programming solvers to determine ideal parameters (e.g., ParamILS [1]) certainly cast a major shadow on the potency of the model and run mantra that is evolving into model and search for the right parameters. © 2012 Springer-Verlag.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

An optimal filtering algorithm for table constraints

An optimal filtering algorithm for table constraints

引用

18th international conference on principles and practice of constraint programming, cp 2012

作者： Mairy, Jean-Baptiste Van Hentenryck, Pascal Deville, Yves ICTEAM Université Catholique de Louvain Belgium Optimization Research Group NICTA University of Melbourne Australia

ISBN: (纸本)9783642335570

Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. this paper proposes four efficient value-based algorithms for table constraints, meaning that the propagation queue also contains information on the removed values. One of these algorithms (AC5TC-Tr) is proved to have an optimal time complexity of O(r•t + r •d) per table constraint. Experimental results show that, on structured instances, all our algorithms are two or three times faster than the state of the art STR2+ and MDD c algorithms. © 2012 Springer-Verlag.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Applying constraint programming to Identification and Assignment of Service Professionals

Applying Constraint Programming to Identification and Assign...

引用

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

作者： Asaf, Sigal Eran, Haggai Richter, Yossi Connors, Daniel P. Gresh, Donna L. Ortega, Julio Mcinnis, Michael J. Univ Haifa Campus IBM Haifa Res Lab IL-31905 Haifa Israel Thomas J Watson Res Ctr IBM Res Div Yorktown Hts NY USA IBM Global Business Serv Dallas TX 1503 USA IBM Global Business Serv Southbury CT 06488 USA

ISBN: (纸本)9783642153952

Today many companies face the challenge of matching highly-skilled professionals to high-end positions in large organizations and human deployment agencies. Non-accurate matches in these businesses can result in significant monetary losses and other negative effects. Unlike traditional Workforce Management (WM) problems such as shift scheduling, highly-skilled employees are professionally distinguishable from each other and hence non-interchangeable. therefore, the techniques used for shift-scheduling can't be applied to the highly-skilled WM domain. Our work focuses on providing a constraint programming solution for supporting the assignment of highly-skilled professionals. Our experience shows that cp is well adapted to this problem. cp supports very well the underlying constraints. In addition, the rich expressive language supported by cp allows us to provide a convenient mechanism for changing and adding new matching and preference constraints. Based on this technology, we have built a tool that is currently being used by IBM service organizations and provides strong business results.

关键词： Human resource management

来源：评论

学校读者我要写书评

暂无评论

Solving a Telecommunications Feature Subscription Configuration Problem

引用

14th international conference on principles and practice of constraint programming (cp 2008)

作者： Lesaint, David Mehta, Deepak O'Sullivan, Barry Quesada, Luis Wilson, Nic Intelligent Systems Research Centre British Telecom United Kingdom Cork Constraint Computation Centre University College Cork Ireland

ISBN: (纸本)9783540859574

Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. the configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation. In this paper, we show that this problem is NP-hard and we present a constraint programming formulation using the variable weighted constraint satisfaction problem framework. We also present simple formulations using partial weighted maximum satisfiability and integer linear programming. We experimentally compare our formulations of the different approaches;the results suggest that our constraint programming approach is the best of the three overall.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Exploiting Decomposition in constraint Optimization Problems

引用

14th international conference on principles and practice of constraint programming (cp 2008)

作者： Kitching, Matthew Bacchus, Fahiem Univ Toronto Dept Comp Sci Toronto ON M5S 1A1 Canada

ISBN: (纸本)9783540859574

Decomposition is it powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP'S) the standard technique of invoking a separate recursion to solve each independent component can significantly reduce the strength of the bounds that can be applied when using branch rind bound techniques. In this paper we present a new search algorithm that can obtain many of the computational benefits of decomposition without having to resort to separate recursions. that is, the algorithm explores a standard OR tree not an AND-OR tree. In this way incremental information gathered from any component can be immediately applied to improve the bounding information for all of the other components. We also discuss how caching and local propagation can be combined with our approach and finally test our methods empirically to verify their potential.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A constraint programming Approach for Allocation and Scheduling on the CELL Broadband Engine

引用

14th international conference on principles and practice of constraint programming (cp 2008)

作者： Benini, Luca Lombardi, Michele Milano, Michela Ruggiero, Martino Univ Bologna DEIS I-40136 Bologna Italy

ISBN: (纸本)9783540859574

the Cell BE processor provides both scalable computation power and flexibility, and it is already being adopted for many computational intensive applications like aerospace, defense, medical imaging and gaming. Despite of its merits, it also presents many challenges. as it is now widely known that is very difficult to program the Cell BE in an efficient manner. Hence, the creation of an efficient software development framework is becoming the key challenge for this computational platform. We have developed a novel software toolkit, called Cellflow, which enables developers to quickly build multi-task applications for Cell-based platform. We support programmers from the initial stage of their work, through a development-time software infrastructure, to the final stage of the application development, proposing a safe and easy-to-use explicit parallel programming model. A fundamental component of the software toolkit is the off-line allocator and scheduler that manages hardware resources while optimizing performance metrics such as execution time, allocation costs, power. the optimization engine receives as input a task graph representing an application, the hardware resources and produces an optimal allocation and scheduling. We have developed various approaches, either based on decomposition [5] or based on pure constraint programming, this latter being the core of this paper. We have identified instance features that guide toward the choice of the best solver for the instance at hand. Experimental result show that constraint programming (possibly combined with Integer programming) is a proper tool for dealing with this kind of applications achieving very good performance.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

principles and practice of constraint programming 2008

引用

丛书名： Lecture Notes in Computer Science

2008年

作者： Peter J. Stuckey

ISBN: (数字)9783540859581

ISBN: (纸本)9783540859574

this book constitutes the refereed proceedings of the 14th international conference on principles and practice of constraint programming, cp 2008, Sydney, Australia, September, 2008. the 27 revised full papers and 23 revised short papers presented together with 6 application papers and the abstracts of one invited lecture were carefully reviewed and selected from 120 submissions. All current issues of computing with constraints are addressed, ranging from methodological and foundational aspects - using algorithms, environments, languages, models and systems - to solving real-world problems in various application fields.

关键词： constraint programming (Computer science) Congresses.

来源：评论

学校读者我要写书评

暂无评论

Towards robust CNF encodings of cardinality constraints

Towards robust CNF encodings of cardinality constraints

引用

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

作者： Marques-Silva, Joao Lynce, Ines Univ Southampton Sch Elect & Comp Sci Southampton SO9 5NH Hants England Univ Tecn Lisboa IST INESC ID Lisbon Portugal

ISBN: (纸本)9783540749691

Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are the different SAT encodings for <= 1 (x(1),..., x(n)) constraints. the most widely used encoding is known as the pairwise encoding, which is quadratic in the number of variables in the constraint. Alternative encodings are in general linear, and require using additional auxiliary variables. In most settings, the pairwise encoding performs acceptably well, but can require unacceptably large Boolean formulas. In contrast, linear encodings yield much smaller Boolean formulas, but in practice SAT solvers often perform unpredictably. this lack of predictability is mostly due to the large number of auxiliary variables that need to be added to the resulting Boolean formula. this paper studies one specific encoding for <= 1 (x(1),...,x(n)) constraints, and shows how a state-of-the-art SAT solver can be adapted to overcome the problem of adding additional auxiliary variables. Moreover, the paper shows that a SAT solver may essentially ignore the existence of auxiliary variables. Experimental results indicate that the modified SAT solver becomes significantly more robust on SAT encodings involving <= 1 (x(1),...,x(n)) constraints.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A filter for the circuit constraint

A filter for the circuit constraint

引用

12th international conference on principles and practice of constraint programming (cp 2006)

作者： Kaya, Latife Genc Hooker, J. N. Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

ISBN: (纸本)3540462678

We present an incomplete filtering algorithm for the circuit constraint. the filter removes redundant values by eliminating nonhamiltonian edges from the associated graph. We identify nonhamiltonian edges by analyzing a smaller graph with labeled edges that is defined on a separator of the original graph. the complexity of the procedure for each separator S is approximately O(vertical bar S vertical bar(5)). We found that it identified all infeasible instances and eliminated about one-third of the redundant domain elements in feasible instances.

关键词： Signal filtering and prediction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共9页 << < 1 2 3 4 5 6 7 8 9 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：