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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,005 篇 会议
51 篇 期刊文献
20 册 图书

馆藏范围

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

日期分布

学科分类号

900 篇 工学
- 876 篇 计算机科学与技术...
- 526 篇 软件工程
- 45 篇 信息与通信工程
- 29 篇 电气工程
- 22 篇 控制科学与工程
- 10 篇 机械工程
- 6 篇 建筑学
- 6 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 交通运输工程
- 5 篇 农业工程
- 5 篇 生物工程
- 4 篇 动力工程及工程热...
- 3 篇 航空宇航科学与技...
- 3 篇 环境科学与工程（可...
551 篇 理学
- 436 篇 数学
- 283 篇 系统科学
- 19 篇 统计学（可授理学、...
- 11 篇 物理学
- 8 篇 生物学
- 5 篇 化学
84 篇 管理学
- 69 篇 管理科学与工程(可...
- 44 篇 工商管理
- 18 篇 图书情报与档案管...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
5 篇 农学
- 5 篇 作物学
2 篇 教育学
- 2 篇 教育学
1 篇 军事学

主题

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

机构

19 篇 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 篇 161 rue ada mont...
6 篇 natl univ singap...
6 篇 univ st andrews ...
6 篇 cork constraint ...
6 篇 chinese univ hon...
5 篇 cornell univ dep...
5 篇 univ coll cork d...
5 篇 ben gurion univ ...
5 篇 brown univ dept ...
5 篇 department of co...

作者

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

语言

1,073 篇 英文
3 篇 中文

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

共 1076 条记录，以下是911-920 订阅

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

详细简洁

排序：

DPMC: Weighted Model Counting by Dynamic programming on Project-Join Trees 26th

DPMC: Weighted Model Counting by Dynamic Programming on Proj...

引用

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

作者： Dudek, Jeffrey M. Phan, Vu H. N. Vardi, Moshe Y. Rice University HoustonTX77005 United States

ISBN: (纸本)9783030584740

We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form. At the center of our framework are project-join trees, which specify efficient project-join orders to apply additive projections (variable eliminations) and joins (clause multiplications). In this framework, model counting is performed in two phases. First, the planning phase constructs a project-join tree from a formula. Second, the execution phase computes the model count of the formula, employing dynamic programming as guided by the project-join tree. We empirically evaluate various methods for the planning phase and compare constraint-satisfaction heuristics with tree-decomposition tools. We also investigate the performance of different data structures for the execution phase and compare algebraic decision diagrams with tensors. We show that our dynamic-programming model-counting framework DPMC is competitive with the state-of-the-art exact weighted model counters Cachet, c2d, d4, and miniC2D. © 2020, Springer Nature Switzerland AG.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Extending forward checking 6th

引用

6th international conference on principles and practice of constraint programming, CP2000

作者： Bacchus, Fahiem Department. of Computer Science University Of Toronto 6 Kings College Road TorontoONM5S 1A4 Canada

ISBN: (纸本)3540410538

Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had the most practical impact. these algorithms use constraint propagation during search to prune inconsistent values from the domains of the uninstantiated variables. In this paper we present a general approach to extending constraint propagating algorithms, especially forward checking. In particular, we provide a simple yet flexible mechanism for pruning domain values, and show that with this in place it becomes easy to utilize new mechanisms for detecting inconsistent values during search. this leads to a powerful and uniform technique for designing new CSP algorithms: one simply need design new methods for detecting inconsistent values and then interface them with the domain pruning mechanism. Furthermore, we also show that algorithms following this design can proved to be correct in a simple and uniform way. To demonstrate the utility of these ideas five "new" CSP algorithms are presented. © Springer-Verlag Berlin Heidelberg 2000.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Global constraints for integer and set value precedence

引用

10th international conference on principles and practice of constraint programming, CP 2004

作者： Law, Yat Chiu Lee, Jimmy H. M. Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin Hong Kong

ISBN: (纸本)3540232419

the paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of symmetries in practice. Although value precedence can be expressed straightforwardly using if-then constraints in existing constraint programming systems, the resulting formulation is inefficient both in terms of size and runtime. We present two propagation algorithms for implementing global constraints on value precedence in the integer and set domains. Besides conducting experiments to verify the feasibility and efficiency of our proposal, we characterize also the propagation level attained by various usages of the global constraints as well as the conditions when the constraints can be used consistently with other types of symmetry breaking constraints. © Springer-Verlag Berlin Heidelberg 2004.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

programming with TOY(FD)

引用

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

作者： Fernández, Antonio J. Hortalá-González, Teresa Sáenz-Pérez, Fernando Dpto. Lenguajes y Ciencias de la Computación Univ. of Malaga Spain Dpto. Sist. Inf. y Prog. Univ. Complutense of Madrid Spain

ISBN: (纸本)3540292381

In [1] we presented the language TOY (FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that TOY (FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP(FD)) as it integrates FD constraint solving, lazy evaluation, higher order applications of functions and constraints, polymorphism, type checking, composition of functions (and, in particular, constraints), combination of relational and functional notation, and a number of other characteristics. these features allow to write more concise programs, therefore increasing the expressivity level. Prom an implementation point of view, TOY (FD) integrates the higher-order lazy functional logic language TOY and the efficient FD constraint solver of SICStus Prolog. From a programming point of view, TOY (FD) is the first constraint functional logic programming system that provides a wide set of FD constraints comparable to existing CLP(FD) systems and which is competitive with them. TOY(FD) supports relational constraints including equality, disequality, arithmetical operators on constraints, a wide set of well-known global constraints (e.g., all_different/1), membership constraints (e.g., domain/3), propositional constraints, and enumeration constraints (e.g., labeling/2, with a number of strategies) with optimization. TOY (FD) also provides a glass box approach via a set of predefined functions called reflection constraints that allow, at runtime, to recover internal information about the constraint solving process. these functions increase the flexibility of the language as they allow the user to construct specific constraint mechanisms such as new search strategies. Generally speaking, TOY(FD) is, from its nature, different to all existing CLP(FD) languages as its operational mechanism is the result of combining the operational methods of logic languages (i.e., unific

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Minimizing cumulative batch processing time for an industrial oven scheduling problem 27

Minimizing cumulative batch processing time for an industria...

引用

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

作者： Lackner, Marie-Louise Mrkvicka, Christoph Musliu, Nysret Walkiewicz, Daniel Winter, Felix Chrstn. Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling DBAI TU Wien Austria MCP GmbH Wien Austria

ISBN: (纸本)9783959772112

We introduce the Oven Scheduling Problem (OSP), a new parallel batch scheduling problem that arises in the area of electronic component manufacturing. Jobs need to be scheduled to one of several ovens and may be processed simultaneously in one batch if they have compatible requirements. the scheduling of jobs must respect several constraints concerning eligibility and availability of ovens, release dates of jobs, setup times between batches as well as oven capacities. Running the ovens is highly energy-intensive and thus the main objective, besides finishing jobs on time, is to minimize the cumulative batch processing time across all ovens. this objective distinguishes the OSP from other batch processing problems which typically minimize objectives related to makespan, tardiness or lateness. We propose to solve this NP-hard scheduling problem via constraint programming (CP) and integer linear programming (ILP) and present corresponding CP- and ILP-models. For an experimental evaluation, we introduce a multi-parameter random instance generator to provide a diverse set of problem instances. Using state-of-the-art solvers, we evaluate the quality and compare the performance of our CP- and ILP-models, which could find optimal solutions for many instances. Furthermore, using our models we are able to provide upper bounds for the whole benchmark set including large-scale instances. © Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, and Felix Winter.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Effective Encodings of constraint programming Models to SMT 26th

Effective Encodings of Constraint Programming Models to SMT

引用

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

作者： Davidson, Ewan Akgün, Özgür Espasa, Joan Nightingale, Peter School of Computer Science University of St Andrews St Andrews United Kingdom Department of Computer Science University of York York United Kingdom

ISBN: (纸本)9783030584740

Satisfiability Modulo theories (SMT) is a well-established methodology that generalises propositional satisfiability (SAT) by adding support for a variety of theories such as integer arithmetic and bit-vector operations. SMT solvers have made rapid progress in recent years. In part, the efficiency of modern SMT solvers derives from the use of specialised decision procedures for each theory. In this paper we explore how the Essence Prime constraint modelling language can be translated to the standard SMT-LIB language. We target four theories: bit-vectors (QF_BV), linear integer arithmetic (QF_LIA), non-linear integer arithmetic (QF_NIA), and integer difference logic (QF_IDL). the encodings are implemented in the constraint modelling tool Savile Row. In an extensive set of experiments, we compare our encodings for the four theories, showing some notable differences and complementary strengths. We also compare our new encodings to the existing work targeting SMT and SAT, and to a well-established learning CP solver. Our two proposed encodings targeting the theory of bit-vectors (QF_BV) both substantially outperform earlier work on encoding to QF_BV on a large and diverse set of problem classes. © 2020, Springer Nature Switzerland AG.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

A k-opt based constraint for the TSP 27

A k-opt based constraint for the TSP

引用

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

作者： Isoart, Nicolas Régin, Jean-Charles Université Côte d'Azur Nice France

ISBN: (纸本)9783959772112

the LKH algorithm based on k-opt is an extremely efficient algorithm solving the TSP. Given a non-optimal tour in a graph, the idea of k-opt is to iteratively swap k edges of this tour in order to find a shorter tour. However, the optimality of a tour cannot be proved with this method. In that case, exact solving methods such as CP can be used. the CP model is based on a graph variable with mandatory and optional edges. through branch-and-bound and filtering algorithms, the set of mandatory edges will be modified. In this paper, we introduce a new constraint to the CP model named mandatory Hamiltonian path constraint searching for k-opt in the mandatory Hamiltonian paths. Experiments have shown that the mandatory Hamiltonian path constraint allows us to gain on average a factor of 3 on the solving time. In addition, we have been able to solve some instances that remain unsolved with the state of the art CP solver with a 1 week time out. © Nicolas Isoart and Jean-Charles Régin.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Utilizing constraint optimization for industrial machine workload balancing 27

Utilizing constraint optimization for industrial machine wor...

引用

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

作者： Kovács, Benjamin Tassel, Pierre Kohlenbrein, Wolfgang Schrott-Kostwein, Philipp Gebser, Martin Universität Klagenfurt Austria Kostwein Holding GmbH Klagenfurt Austria Technische Universität Graz Austria

ISBN: (纸本)9783959772112

Efficient production scheduling is an important application area of constraint-based optimization techniques. Problem domains like flow- and job-shop scheduling have been extensive study targets, and solving approaches range from complete and local search to machine learning methods. In this paper, we devise and compare constraint-based optimization techniques for scheduling specialized manufacturing processes in the build-to-print business. the goal is to allocate production equipment such that customer orders are completed in time as good as possible, while respecting machine capacities and minimizing extra shifts required to resolve bottlenecks. To this end, we furnish several approaches for scheduling pending production tasks to one or more workdays for performing them. First, we propose a greedy custom algorithm that allows for quickly screening the effects of altering resource demands and availabilities. Moreover, we take advantage of such greedy solutions to parameterize and warm-start the optimization performed by integer linear programming (ILP) and constraint programming (CP) solvers on corresponding problem formulations. Our empirical evaluation is based on production data by Kostwein Holding GmbH, a worldwide supplier in the build-to-print business, and thus demonstrates the industrial applicability of our scheduling methods. We also present a user-friendly web interface for feeding the underlying solvers with customer order and equipment data, graphically displaying computed schedules, and facilitating the investigation of changed resource demands and availabilities, e.g., due to updating orders or including extra shifts. © Benjamin Kovács, Pierre Tassel, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein, and Martin Gebser.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

On-demand bound computation for best-first constraint optimization

引用

10th international conference on principles and practice of constraint programming, CP 2004

作者： Sachenbacher, Martin Williams, Brian C. MIT Computer Science and Artificial Intelligence Laboratory CambridgeMA02139 United States

ISBN: (纸本)3540232419

An important class of algorithms for constraint optimization searches for solutions guided by a heuristic evaluation function (bound). When only a few best solutions are required, significant effort can be wasted pre-computing bounds that are not used during the search. We introduce a method that generates – based on lazy, best-first variants of constraint projection and combination operators – only those bounds that are specifically required in order to generate a next best solution. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 88 89 90 91 92 93 94 95 96 97 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：