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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

131 篇 会议
3 册 图书
2 篇 期刊文献

馆藏范围

136 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

118 篇 工学
- 114 篇 计算机科学与技术...
- 38 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 土木工程
- 1 篇 化学工程与技术
68 篇 理学
- 60 篇 数学
- 21 篇 系统科学
- 4 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
11 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 教育学

主题

26 篇 constraint theor...
14 篇 constraint satis...
9 篇 computer program...
8 篇 constraint progr...
6 篇 linear programmi...
4 篇 integer programm...
3 篇 target cost
3 篇 problem solving
3 篇 goal programming
3 篇 mathematical log...
3 篇 programming lang...
3 篇 artificial intel...
3 篇 logics and meani...
3 篇 scheduling
2 篇 software enginee...
2 篇 modeling languag...
2 篇 symmetry
2 篇 constrained opti...
2 篇 logic programmin...
2 篇 global constrain...

机构

3 篇 univ coll cork c...
3 篇 univ st andrews ...
3 篇 univ oxford comp...
3 篇 natl univ irelan...
3 篇 univ melbourne m...
3 篇 brown univ provi...
2 篇 univ st andrews ...
2 篇 nicta nsw
2 篇 insight centre f...
2 篇 univ genoa dibri...
2 篇 cork constraint ...
2 篇 univ coll cork d...
2 篇 univ london roya...
2 篇 imdea software i...
2 篇 aix marseille un...
2 篇 aix marseille un...
2 篇 univ coll cork c...
2 篇 faculty of elect...
2 篇 univ st andrews ...
1 篇 ligm ecole des p...

作者

6 篇 nightingale pete...
6 篇 gent ian p.
6 篇 o'sullivan barry
5 篇 miguel ian
5 篇 van hentenryck p...
5 篇 jefferson christ...
5 篇 quesada luis
4 篇 kotthoff lars
4 篇 bessiere christi...
4 篇 de givry simon
3 篇 stuckey peter j.
3 篇 werner tomáš
3 篇 jeavons peter
3 篇 simonis helmut
3 篇 lombardi michele
3 篇 walsh toby
3 篇 dlask tomáš
3 篇 mehta deepak
2 篇 pearson justin
2 篇 solnon christine

语言

136 篇 英文

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

共 136 条记录，以下是51-60 订阅

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

详细简洁

排序：

Value Interchangeability in Scenario Generation

Value Interchangeability in Scenario Generation

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Prestwich, Steven D. Laumanns, Marco Kawas, Ban Univ Coll Cork Dept Comp Sci Cork Constraint Computat Ctr Cork Ireland IBM Res Zurich CH-8803 Ruschlikon Switzerland IBM Corp Thomson J Watson Res ctr Yorktown Hts NY USA

ISBN: (纸本)9783642406263;9783642406270

Several types of symmetry have been identified and exploited in constraint programming, leading to large reductions in search time. We present a novel application of one such form of symmetry: detecting dynamic value interchangeability in the random variables of a 2-stage stochastic problem. We use a real-world problem from the literature: finding an optimal investment plan to strengthen a transportation network, given that a future earthquake probabilistically destroys links in the network. Detecting interchangeabilities enables us to bundle together many equivalent scenarios, drastically reducing the size of the problem and allowing the exact solution of cases previously considered intractable and solved only approximately.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Search programming 9th

引用

9th international conference on principles and practice of constraint programming, CP 2003

作者： Legierski, Wojciech Institute of Automatic Control Silesian Technical University Akademicka 16 Gliwice Poland

来源：评论

学校读者我要写书评

暂无评论

Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector

Experimental Comparison of BTD and Intelligent Backtracking:...

引用

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

作者： Blet, Loic Ndiaye, Samba Ndojh Solnon, Christine Univ Lyon LIRIS UMR5205 Lyon France

ISBN: (纸本)9783319104287;9783319104270

We consider a generic binary CSP solver parameterized by high-level design choices, i.e., backtracking mechanisms, constraint propagation levels, and variable ordering heuristics. We experimentally compare 24 different configurations of this generic solver on a benchmark of around a thousand instances. this allows us to understand the complementarity of the different search mechanisms, with an emphasis on Backtracking with Tree Decomposition (BTD). then, we use a per-instance algorithm selector to automatically select a good solver for each new instance to be solved. We introduce a new strategy for selecting the solvers of the portfolio, which aims at maximizing the number of instances for which the portfolio contains a good solver, independently from a time limit.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Insights into Parallelism with Intensive Knowledge Sharing

Insights into Parallelism with Intensive Knowledge Sharing

引用

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

作者： Sabharwal, Ashish Samulowitz, Horst Allen Inst Artificial Intelligence AI2 Seattle WA 98103 USA IBM Watson Res Ctr Yorktown Hts NY 10598 USA

ISBN: (纸本)9783319104287;9783319104270

Novel search space splitting techniques have recently been successfully exploited to paralleliz constraint programming and Mixed Integer programming solvers. We first show how universal hashing can be used to extend one such interesting approach to a generalized setting that goes beyond discrepancy-based search, while still retaining strong theoretical guarantees. We then explain that such static or explicit splitting approaches are not as effective in the context of parallel combinatorial search with intensive knowledge acquisition and sharing such as parallel SAT, where implicit splitting through clause sharing appears to dominate. Furthermore, we show that in a parallel setting there exists a surprising tradeoff between the well-known communication cost for knowledge sharing across multiple compute nodes and the so far neglected cost incurred by the computational load per node. We provide experimental evidence that one can successfully exploit this tradeoff and achieve reasonable speedups in parallel SAT solving beyond 16 cores.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Model Combinators for Hybrid Optimization

Model Combinators for Hybrid Optimization

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Fontaine, Daniel Michel, Laurent Van Hentenryck, Pascal Univ Connecticut Storrs CT 06269 USA Univ Melbourne NICTA Melbourne Vic 3010 Australia

ISBN: (纸本)9783642406263;9783642406270

In recent years, CML, G12 and SIMPL, have achieved significant progress in automating the generation of hybrid solvers from high-level model specifications. this paper pushes this research direction one step further and introduces the concept of model combinators to provide principled model compositions. these model combinators rely on runnables capturing executable models, runnable signatures that capture what runnables can produce and consume, and model hierarchies, which track relationships among models. these concepts make it possible to enforce the soundness of model compositions and to determine the best model compositions automatically. A prototype of the framework on top of the Objective-CP optimization system is presented.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Breaking Symmetry with Different Orderings

Breaking Symmetry with Different Orderings

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Narodytska, Nina Walsh, Toby NICTA Sydney NSW Australia UNSW Sydney NSW Australia

ISBN: (纸本)9783642406263;9783642406270

We can break symmetry by eliminating solutions within each symmetry class. For instance, the Lex-Leader method eliminates all but the smallest solution in the lexicographical ordering. Unfortunately, the Lex-Leader method is intractable in general. We prove that, under modest assumptions, we cannot reduce the worst case complexity of breaking symmetry by using other orderings on solutions. We also prove that a common type of symmetry, where rows and columns in a matrix of decision variables are interchangeable, is intractable to break when we use two promising alternatives to the lexicographical ordering: the Gray code ordering (which uses a different ordering on solutions), and the Snake-Lex ordering (which is a variant of the lexicographical ordering that re-orders the variables). Nevertheless, we show experimentally that using other orderings like the Gray code to break symmetry can be beneficial in practice as they may better align with the objective function and branching heuristic.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems

Constraint Based Computation of Periodic Orbits of Chaotic D...

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Goldsztejn, Alexandre Granvilliers, Laurent Jermann, Christophe CNRS LINA UMR 6241 2 Rue Houssiniere F-44300 Nantes France Univ Nantes LINA UMR 6241 F-44035 Nantes France

ISBN: (纸本)9783642406263;9783642406270

the chaos theory emerged at the end of the 19th century, and it has given birth to a deep mathematical theory in the 20th century, with a strong practical impact (e. g., weather forecast, turbulence analysis). Periodic orbits play a key role in understanding chaotic systems. their rigorous computation provides some insights on the chaotic behavior of the system and it enables computer assisted proofs of chaos related properties (e. g., topological entropy). In this paper, we show that the (numerical) constraint programming framework provides a very convenient and efficient method for computing periodic orbits of chaotic dynamical systems: Indeed, the flexibility of CP modeling allows considering various models as well as including additional constraints (e. g., symmetry breaking constraints). Furthermore, the richness of the different solving techniques (tunable local propagators, search strategies, etc.) leads to highly efficient computations. these strengths of the CP framework are illustrated by experimental results on classical chaotic systems from the literature.

关键词： Chaotic dynamical systems periodic orbits topological entropy numerical constraint satisfaction symmetry breaking

来源：评论

学校读者我要写书评

暂无评论

Testing continuous double auctions with a constraint-based oracle

Testing continuous double auctions with a constraint-based o...

引用

16th international conference on principles and practice of constraint programming, CP 2010

作者： Castañeda Lozano, Roberto Schulte, Christian Wahlberg, Lars KTH - Royal Institute of Technology Sweden Cinnober Financial Technology AB Stockholm Sweden

ISBN: (纸本)364215395X

Computer trading systems are essential for today's financial markets where the trading systems' correctness is of paramount economical significance. Automated random testing is a useful technique to find bugs in these systems, but it requires an independent system to decide the correctness of the system under test (known as oracle problem). this paper introduces a constraint-based oracle for random testing of a real-world trading system. the oracle provides the expected results by generating and solving constraint models of the trading system's continuous double auction. constraint programming is essential for the correctness of the test oracle as the logic for calculating trades can be mapped directly to constraint models. the paper shows that the generated constraint models can be solved efficiently. Most importantly, the approach is shown to be successful by finding errors in a deployed financial trading system and in its specification. © 2010 Springer-Verlag.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

Towards Lazy Grounding with Lazy Normalization in Answer-Set programming 16

Towards Lazy Grounding with Lazy Normalization in Answer-Set...

引用

16th international conference on principles of Knowledge Representation and Reasoning

作者： Bomanson, Jori Janhunen, Tomi Weinzierl, Antonius Aalto Univ Dept Comp Sci Espoo Finland

ISBN: (纸本)9781577358039

Set programming (ASP) is an expressive rule-based knowledge-representation formalism supported by efficient solver technology. Traditional evaluation of answer-set programs takes place in two phases: grounding and solving. Grounding incurs an up-to exponential increase in space, termed the grounding bottleneck of ASP, which is often encountered in practice. Lazy grounding avoids this bottleneck but is restricted to normal rules, significantly limiting the expressive power of this approach. We propose a framework to handle aggregates by normalizing them on demand during the lazy grounding process;we call this approach lazy normalization. It is feasible for different types of aggregates and can bring about up-to exponential gains in space and time.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Approaches for Balancing Bike Sharing Systems

Constraint-Based Approaches for Balancing Bike Sharing Syste...

引用

19th annual international conference on principles and practice of constraint programming (CP)

作者： Di Gaspero, Luca Rendl, Andrea Urli, Tommaso Univ Udine DIEGM Via Sci 206 I-33100 Udine Italy Austrian Inst Technol Mobility Dept Dynam Transport Syst Vienna Austria

ISBN: (纸本)9783642406263;9783642406270

In order to meet the users' demand, bike sharing systems must be regularly rebalanced. the problem of balancing bike sharing systems (BBSS) is concerned with designing optimal tours and operating instructions for relocating bikes among stations to maximally comply with the expected future bike demands. In this paper, we tackle the BBSS by means of constraint programming: first, we introduce two novel constraint models for the BBSS including a smart branching strategy that focusses on the most promising routes. Second, in order to speed-up the search process, we incorporate both models in a Large Neighborhood Search (LNS) approach that is adapted to the respective CP model. third, we perform a computational evaluation on instances based on real-world data, where we see that the LNS approach outperforms the Branch & Bound approach and is competitive with other existing approaches.

关键词： Bicycles

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：