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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

the semigroups of order 10

The semigroups of order 10

引用

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

作者： Distler, Andreas Jefferson, Chris Kelsey, Tom Kotthoff, Lars Centro de Álgebra Universidade de Lisboa Lisboa 1649-003 Portugal School of Computer Science University of St. Andrews KY16 9SX United Kingdom

ISBN: (纸本)9783642335570

the number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed constraint Satisfaction to show that the number of non-equivalent semigroups of order 10 is 12,418,001,077,381,302,684. this solves a previously open problem in Mathematics, and has directly led to improvements in constraint Satisfaction technology. © 2012 Springer-Verlag.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Bounding Linear Programs by constraint Propagation: Application to Max-SAT 26th

Bounding Linear Programs by Constraint Propagation: Applicat...

引用

26th international conference on principles and practice of constraint programming, CP 2020

作者： Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic

ISBN: (纸本)9783030584740

the Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this technique by replacing arc consistency with a (problem-dependent) constraint propagation in a system of linear inequalities over the reals. When propagation detects infeasibility, the infeasibility certificate (a solution to the alternative system in Farkas’ lemma) provides a dual improving direction. We illustrate this approach on the LP relaxation of Weighted Max-SAT. We show in experiments that the obtained bounds are often not far from global LP optima and we prove that they are exact for known tractable subclasses of Weighted Max-SAT. © 2020, Springer Nature Switzerland AG.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

An interval constraint programming approach for quasi capture tube validation 27

An interval constraint programming approach for quasi captur...

引用

27th international conference on principles and practice of constraint programming, CP 2021

作者： Bedouhene, Abderahmane Neveu, Bertrand Trombettoni, Gilles Jaulin, Luc Le Menec, Stéphane LIGM Ecole des Ponts ParisTech Université Gustave Eiffel CNRS Marne-la-Vallée France LIRMM Université de Montpellier CNRS France Lab-STICC ENSTA-Bretagne Brest France MBDA Le Plessis Robinson France

ISBN: (纸本)9783959772112

Proving that the state of a controlled nonlinear system always stays inside a time moving bubble (or capture tube) amounts to proving the inconsistency of a set of nonlinear inequalities in the time-state space. In practice however, even with a good intuition, it is difficult for a human to find such a capture tube except for simple examples. In 2014, Jaulin et al. established properties that support a new interval approach for validating a quasi capture tube, i.e. a candidate tube (with a simple form) from which the mobile system can escape, but into which it enters again before a given time. A quasi capture tube is easy to find in practice for a controlled system. Merging the trajectories originated from the candidate tube yields the smallest capture tube enclosing it. this paper proposes an interval constraint programming solver dedicated to the quasi capture tube validation. the problem is viewed as a differential CSP where the functional variables correspond to the state variables of the system and the constraints define system trajectories that escape from the candidate tube "for ever". the solver performs a branch and contract procedure for computing the trajectories that escape from the candidate tube. If no solution is found, the quasi capture tube is validated and, as a side effect, a corrected smallest capture tube enclosing the quasi one is computed. the approach is experimentally validated on several examples having 2 to 5 degrees of freedom. © Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, and Stéphane Le Menec.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Deep Learning for the Generation of Heuristics in Answer Set programming: A Case Study of Graph Coloring 16th

Deep Learning for the Generation of Heuristics in Answer Set...

引用

16th international conference on Logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Dodaro, Carmine Ilardi, Davide Oneto, Luca Ricca, Francesco Univ Calabria DeMaCS Arcavacata Di Rende Italy Univ Genoa DIBRIS Genoa Italy

ISBN: (纸本)9783031157073;9783031157066

Answer Set programming (ASP) is a well-established declarative AI formalism for knowledge representation and reasoning. ASP systems were successfully applied to both industrial and academic problems. Nonetheless, their performance can be improved by embedding domain-specific heuristics into their solving process. However, the development of domain-specific heuristics often requires both a deep knowledge of the domain at hand and a good understanding of the fundamental working principles of the ASP solvers. In this paper, we investigate the use of deep learning techniques to automatically generate domain-specific heuristics for ASP solvers targeting the well-known graph coloring problem. Empirical results show that the idea is promising: the performance of the ASP solver WASP can be improved.

关键词： answer set programming deep learning heuristics graph coloring

来源：评论

学校读者我要写书评

暂无评论

Computing Relaxations for the three-Dimensional Stable Matching Problem with Cyclic Preferences 28

Computing Relaxations for the Three-Dimensional Stable Match...

引用

28th international conference on principles and practice of constraint programming, CP 2022

作者： Cseh, Ágnes Escamocher, Guillaume Quesada, Luis Institute of Economics Centre for Economic and Regional Studies Budapest Hungary Insight Centre for Data Analytics School of Computer Science and Information Technology University College Cork Ireland

ISBN: (纸本)9783959772402

constraint programming has proven to be a successful framework for determining whether a given instance of the three-dimensional stable matching problem with cyclic preferences (3dsm-cyc) admits a solution. If such an instance is satisfiable, constraint models can even compute its optimal solution for several different objective functions. On the other hand, the only existing output for unsatisfiable 3dsm-cyc instances is a simple declaration of impossibility. In this paper, we explore four ways to adapt constraint models designed for 3dsm-cyc to the maximum relaxation version of the problem, that is, the computation of the smallest part of an instance whose modification leads to satisfiability. We also extend our models to support the presence of costs on elements in the instance, and to return the relaxation with lowest total cost for each of the four types of relaxation. Empirical results reveal that our relaxation models are efficient, as in most cases, they show little overhead compared to the satisfaction version. © Ágnes Cseh, Guillaume Escamocher, and Luis Quesada.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A constraint based agent for TAC-SCM

引用

11th international conference on principles and practice of constraint programming - CP 2005

作者： Burke, David A. Brown, Kenneth N. Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)3540292381

the annual international Trading Agent Competition-Supply Chain Management (TAC-SCM) game is based around the manufacture and supply of PCs. there are multiple agents in the game, scheduling production, competing for orders from customers and components from suppliers. A key decision to be made each day in the game is what offers should be made to customers. Each day, the agents receive a set of request for quotes (RFQ) from customers, agents respond with offers, and then the customers select the lowest bid. We have developed an agent to compete in the competition that combines constraint-based optimisation, reasoning with probabilities, and learning of market conditions in an attempt to determine what customer requests to bid on and what prices to bid. Our agent maintains prices that correspond to different probabilities of success in winning contracts, using an online learning approach. By keeping track of the ratio of offers accepted to those made, the prices can be updated iteratively to move closer to their target probability. this range of price/probability pairs is then used as input to a constraint model. For each request, the model chooses whether or not to bid, and selects a price from the range. these decisions are restricted by capacity and supply constraints. A capacity constraint ensures that we will be able to schedule any new orders we receive with existing orders such that the factory capacity for each day in the current horizon is not exceeded. the agents production ability is also subject to component availability, By ordering components in advance, we know the current amount of components available, and we also know how much of each component will be arriving at each clay. this allows us to add a constraint for availability of supplies. An objective function is specified that maximises our expected profit, where the profit on a request is calculated by subtracting from the selling price the cost of components together with late delivery penalties

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Scheduling the Equipment Maintenance of an Electric Power Transmission Network Using constraint programming 28

Scheduling the Equipment Maintenance of an Electric Power Tr...

引用

28th international conference on principles and practice of constraint programming, CP 2022

作者： Popovic, Louis Côté, Alain Gaha, Mohamed Nguewouo, Franklin Cappart, Quentin Computer Engineering and Software Engineering Department Polytechnique Montréal Canada IREQ Varennes Canada Hydro-Québec Canada

ISBN: (纸本)9783959772402

Modern electrical power utilities must maintain their electrical equipment and replace it when the end of its useful life arrives. the Transmission Maintenance Scheduling (TMS) problem consists in generating an annual maintenance plan for electric power transportation equipment while maintaining the stability of the network and ensuring a continuous power flow for customers. Each year, a list of equipment (power lines, capacitors, transistors, etc.) that needs to be maintained or replaced is available and the goal is to generate an optimal maintenance plan. this paper proposes a constraint-based scheduling approach for solving the TMS problem. the model considers two types of constraints: (1) constraints that can be naturally formalized inside a constraint programming model, and (2) complex constraints that do not have a proper formalization from the field specialists. the latter cannot be integrated inside the model due to their complexity. their satisfaction is thus verified by a black box tool, which is a simulator that mimics the impact of a maintenance schedule on the real power network. the simulator is based on complex differential power-flow equations. Experiments are carried out at five strategic points of Hydro-Québec power grid infrastructure, and involve more than 200 electrical equipment and 300 withdrawal requests. Results show that the model is able to comply with most of the formalized and unformalized constraints. It also generates maintenance schedules within an execution time of only a few minutes. the generated schedules are similar to the ones proposed by a field specialist and can be used to simulate maintenance programs for the next 10 years. © Louis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, and Quentin Cappart.

关键词： Electric power transmission networks

来源：评论

学校读者我要写书评

暂无评论

Bounds on Weighted CSPs using constraint propagation and super-reparametrizations 27

Bounds on Weighted CSPs using constraint propagation and sup...

引用

27th international conference on principles and practice of constraint programming, CP 2021

作者： Dlask, Tomáš Werner, Tomáš De Givry, Simon Faculty of Electrical Engineering Czech Technical University in Prague Czech Republic Université Fédérale de Toulouse ANITI INRAE UR 875 France

ISBN: (纸本)9783959772112

We propose a framework for computing upper bounds on the optimal value of the (maximization version of) Weighted CSP (WCSP) using super-reparametrizations, which are changes of the weights that keep or increase the WCSP objective for every assignment. We show that it is in principle possible to employ arbitrary (under certain technical conditions) constraint propagation rules to improve the bound. For arc consistency in particular, the method reduces to the known Virtual AC (VAC) algorithm. Newly, we implemented the method for singleton arc consistency (SAC) and compared it to other strong local consistencies in WCSPs on a public benchmark. the results show that the bounds obtained from SAC are superior for many instance groups. © 2021 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Quantum-Accelerated Global constraint Filtering 26th

Quantum-Accelerated Global Constraint Filtering

引用

26th international conference on principles and practice of constraint programming, CP 2020

作者： Booth, Kyle E. C. O’Gorman, Bryan Marshall, Jeffrey Hadfield, Stuart Rieffel, Eleanor NASA Ames Research Center Moffett Field CA94035 United States Mountain ViewCA94043 United States University of California BerkeleyCA94720 United States

ISBN: (纸本)9783030584740

Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the alldifferent constraint and the global cardinality constraint (gcc). the subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search. © 2020, Springer Nature Switzerland AG.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

the weighted average constraint

The weighted average constraint

引用

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

作者： Bonfietti, Alessio Lombardi, Michele DEIS University of Bologna Italy

ISBN: (纸本)9783642335570

Weighted average expressions frequently appear in the context of allocation problems with balancing based constraints. In combinatorial optimization they are typically avoided by exploiting problems specificities or by operating on the search process. this approach fails to apply when the weights are decision variables and when the average value is part of a more complex expression. In this paper, we introduce a novel average constraint to provide a convenient model and efficient propagation for weighted average expressions appearing in a combinatorial model. this result is especially useful for Empirical Models extracted via Machine Learning (see [2]), which frequently count average expressions among their inputs. We provide basic and incremental filtering algorithms. the approach is tested on classical benchmarks from the OR literature and on a workload dispatching problem featuring an Empirical Model. In our experimentation the novel constraint, in particular with incremental filtering, proved to be even more efficient than traditional techniques to tackle weighted average expressions. © 2012 Springer-Verlag.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：