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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,022 篇 期刊文献
819 篇 会议
22 篇 学位论文

馆藏范围

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

日期分布

学科分类号

1,604 篇 工学
- 1,332 篇 计算机科学与技术...
- 489 篇 软件工程
- 177 篇 电气工程
- 139 篇 控制科学与工程
- 134 篇 机械工程
- 55 篇 信息与通信工程
- 51 篇 土木工程
- 40 篇 交通运输工程
- 37 篇 建筑学
- 15 篇 化学工程与技术
- 15 篇 石油与天然气工程
- 15 篇 航空宇航科学与技...
- 14 篇 材料科学与工程（可...
- 11 篇 力学（可授工学、理...
- 11 篇 电子科学与技术（可...
- 11 篇 生物工程
- 10 篇 仪器科学与技术
- 9 篇 动力工程及工程热...
618 篇 管理学
- 599 篇 管理科学与工程(可...
- 119 篇 工商管理
- 12 篇 图书情报与档案管...
484 篇 理学
- 361 篇 数学
- 166 篇 系统科学
- 31 篇 生物学
- 17 篇 物理学
- 6 篇 统计学（可授理学、...
78 篇 经济学
- 65 篇 应用经济学
- 14 篇 理论经济学
15 篇 医学
- 8 篇 基础医学(可授医学...
8 篇 法学
8 篇 教育学
- 6 篇 教育学
8 篇 农学
4 篇 艺术学
2 篇 文学
1 篇 哲学
1 篇 历史学

主题

1,863 篇 constraint progr...
174 篇 scheduling
84 篇 optimization
65 篇 integer programm...
42 篇 combinatorial op...
39 篇 mixed integer pr...
35 篇 local search
35 篇 integer linear p...
29 篇 constraint satis...
28 篇 mathematical pro...
28 篇 machine learning
25 篇 mixed integer li...
23 篇 linear programmi...
23 篇 column generatio...
22 篇 large neighborho...
22 篇 mixed-integer pr...
22 篇 planning
22 篇 global constrain...
22 篇 constraint propa...
20 篇 search

机构

24 篇 pontificia univ ...
13 篇 univ autonoma ch...
13 篇 univ st andrews ...
12 篇 univ toronto dep...
11 篇 univ san sebasti...
10 篇 univ cient sur l...
9 篇 univ bologna dei...
9 篇 brown univ provi...
8 篇 univ tehran coll...
8 篇 univ cent chile ...
7 篇 carnegie mellon ...
7 篇 univ playa ancha...
7 篇 natl univ irelan...
7 篇 univ valparaiso ...
7 篇 new mexico state...
6 篇 katholieke univ ...
6 篇 natl yunlin univ...
6 篇 univ nantes lina...
6 篇 natl univ irelan...
6 篇 hacettepe univ d...

作者

30 篇 crawford broderi...
28 篇 beck j. christop...
26 篇 stuckey peter j.
24 篇 monfroy eric
23 篇 soto ricardo
23 篇 schaus pierre
21 篇 rousseau louis-m...
20 篇 milano michela
18 篇 van hentenryck p...
17 篇 lombardi michele
17 篇 o'sullivan barry
16 篇 miguel ian
14 篇 wallace mark
14 篇 hofstedt petra
14 篇 guns tias
13 篇 castro carlos
13 篇 loudni samir
12 篇 boizumault patri...
12 篇 nightingale pete...
12 篇 nijssen siegfrie...

语言

1,737 篇 英文
97 篇 其他
11 篇 中文
6 篇 法文
2 篇 土耳其文
1 篇 德文
1 篇 西班牙文
1 篇 葡萄牙文

检索条件"主题词=Constraint Programming"

共 1863 条记录，以下是901-910 订阅

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

详细简洁

排序：

Calling Sequence Calculation for Sequential Co-simulation Master 18

Calling Sequence Calculation for Sequential Co-simulation Ma...

引用

32nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS)

作者： Glumac, Slaven Kovacic, Zdenko AVL AST Doo Zagreb Croatia Univ Zagreb Zagreb Croatia

ISBN: (纸本)9781450350921

This paper explores the improvement of non-iterative co-simulation master. A simple hybrid system is depicted and analyzed. Based on this analysis guidelines for calculating the calling sequence are introduced. Guidelines allow the implementation of a new constraint programming algorithm. This algorithm allows better calling sequence selection based solely on information about connecting the co-simulation network. The algorithm is confirmed by the example of co-simulation of a hybrid electric vehicle. In this example, the constraint programming algorithm found a subjectively good calling sequence without any involvement of the model developer.

关键词： non-iterative co-simulation FMI sequential master calling sequence hybrid system constraint programming

来源：评论

学校读者我要写书评

暂无评论

Designing a No-Wait Cyclic Schedule for a Class of Concurrent Repetitive Production Processes

Designing a No-Wait Cyclic Schedule for a Class of Concurren...

引用

16th IFAC Symposium on Information Control Problems in Manufacturing (INCOM)

作者： Wojcik, R. Wroclaw Univ Sci & Technol Fac Elect Dept Comp Engn Wroclaw Poland

The concurrent repetitive manufacturing processes sharing resources according to a mutual exclusion protocol are considered. A system of the processes is a composition of subsystems that consist of n cyclic processes sharing one resource. In case of resource conflicts between the processes regarding access to the resources a certain priority is used (e.g. FIFO rule) which guarantees starvation-free access of the processes to the shared resources. A class of systems which are structurally deadlock-free is considered, i.e. resource requests of repetitive processes can't create closed loop. For this class of systems is searched conflict-free, cyclic schedule for which the processes never wait for the resources, i.e. resource conflicts are avoided and a priority rule is not in the operation. A structure of production processes sharing resources and the operation times are defined. The problem of computing the starting times of the processes for which a no-wait cyclic schedule exists is formulated in a declarative way using constraint programming (CP) method. The necessary and sufficient conditions for existence of a no-wait schedule in the n-process system are given and used to compute the possible schedules of the processes. An illustrative example is presented. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Repetitive processes resource conflicts resolution cyclic scheduling no-wait cycle schedule declarative modeling constraint satisfaction problem constraint programming manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

Modelling and Solving the Senior Transportation Problem 15th

引用

15th International Conference on the Integration of constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Liu, Chang Aleman, Dionne M. Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada

ISBN: (纸本)9783319930312;9783319930305

This paper defines a novel transportation problem, the Senior Transportation Problem (STP), which is inspired by the elderly door-to-door transportation services provided by non-profit organizations. Building on the vehicle routing literature, we develop solution approaches including mixed integer programming (MIP), constraint programming (CP), two logic-based Benders decompositions (LBBD), and a construction heuristic. Empirical analyses on both randomly generated datasets and large real-life datasets are performed. CP achieved the best results, solving to optimality 89% of our real-life instances of up to 270 vehicles with 385 requests in under 600s. The best LBBD model can only solve 17% of those instances to optimality. Further investigation of this somewhat surprising result indicates that, compared to the LBBD approaches, the pure CP model is able to find better solutions faster and then is able to use the bounds from these sub-optimal solutions to reduce the search space slightly more effectively than the decomposition models.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A Complete Tolerant Algebraic Side-Channel Attack for AES with CP 1

引用

24th International Conference on the Principles and Practice of constraint programming (CP)

作者： Liu, Fanghui Cruz, Waldemar Michel, Laurent Univ Connecticut Sch Engn Comp Sci & Engn Dept Storrs CT 06269 USA

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

Tolerant Algebraic Side-Channel Attack (TASCA) is a combination of algebraic and side-channel analysis with error tolerance. Oren et al., used mathematical programming to implement TASCA over a round-limited version of AES. In [7], Liu et al. revisited their results and introduced a TASCA-CP model that delivers solutions to this 1-round relaxation with orders of magnitude improvement in both solving time and memory consumption. This paper extends the result and considers TASCA for the full 10-rounds AES algorithm. Two approaches are introduced: staged and integrated. The staged approach uses TASCA-CP as a spring board to enumerate and check its candidate solutions against the requirements of subsequent rounds. The integrated model formulates all the rounds of AES together with side-channel constraints on all rounds within a single unified optimization model. Empirical results shows both approaches are suitable to find the correct key of AES while the integrated model dominates the staged both in simplicity and solving time.

关键词： Algebraic side-channel attack AES Cryptography Block cipher constraint programming Optimization

来源：评论

学校读者我要写书评

暂无评论

A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining 1

引用

24th International Conference on the Principles and Practice of constraint programming (CP)

作者： Dlala, Imen Ouled Jabbour, Said Raddaoui, Badran Sais, Lakhdar Univ Artois CNRS CRIL F-62307 Lens France Univ Paris Saclay CNRS SAMOVAR Telecom SudParis Evry France Univ Tunis LARODEC Tunis Tunisia

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

constraint programming (CP) and propositional satisfiability (SAT) based framework for modeling and solving pattern mining tasks has gained a considerable audience in recent years. However, this nice declarative and generic framework encounters a scaling problem. The huge size of constraints networks/propositional formulas encoding large datasets is identified as the main bottleneck of most existing approaches. In this paper, we propose a parallel SAT based framework for itemset mining problem to push forward the solving efficiency. The proposed approach is based on a divide-and-conquer paradigm, where the transaction database is partitioned using item-based guiding paths. Such decomposition allows us to derive smaller and independent Boolean formulas that can be solved in parallel. The performance and scalability of the proposed algorithm are evaluated through extensive experiments on several datasets. We demonstrate that our partition-based parallel SAT approach outperforms other CP approaches even in the sequential case, while significantly reducing the performances gap with specialized approaches.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Exploring Properties of a Telecommunication Protocol with Message Delay Using Interactive Theorem Prover 16th

Exploring Properties of a Telecommunication Protocol with Me...

引用

16th International Conference on Software Engineering and Formal Methods (SEFM) Held as Part of Conference on Software Technologies - Applications and Foundations (STAF)

作者： Dubois, Catherine Grinchtein, Olga Pearson, Justin Carlsson, Mats ENSIIE Samovar UMR 5157 CNRS Evry France Ericsson AB Stockholm Sweden Uppsala Univ Uppsala Sweden RISE SICS Stockholm Sweden

ISBN: (纸本)9783319929705;9783319929699

An important task of testing a telecommunication protocol consists in analysing logs. The goal of log analysis is to check that the timing and the content of transmitted messages comply with specification. In order to perform such checks, protocols can be described using a constraint modelling language. In this paper we focus on a complex protocol where some messages can be delayed. Simply introducing variables for possible delays for all messages in the constraint model can drastically increase the complexity of the problem. However, some delays can be calculated, but this calculation is difficult to do by hand and to justify. We present an industrial application of the Coq proof assistant to prove a property of a 4G protocol and validate a constraint model. By using interactive theorem proving we derived constraints for message delays of the protocol and found missing constraints in the initial model.

关键词： Testing of telecommunication protocol constraint programming Formal proof Coq

来源：评论

学校读者我要写书评

暂无评论

A Dynamic programming Approach for Integrating Dynamic Pricing and Capacity Decisions in a Rental Context 18th

引用

18th Congress of the Portuguese-Association-of-Operational-Research (APDIO)

作者： Oliveira, Beatriz B. Carravilla, Maria Antonia Oliveira, Jose Fernando Univ Porto INESC TEC Porto Portugal Univ Porto Fac Engn Porto Portugal

ISBN: (纸本)9783319715834;9783319715827

Car rental companies have the ability and potential to integrate their dynamic pricing decisions with their capacity decisions. Pricing has a significant impact on demand, while capacity, which translates fleet size, acquisition planning and fleet deployment throughout the network, can be used to meet this price-sensitive demand. Dynamic programming has been often used to tackle dynamic pricing problems and also to deal with similar integrated problems, yet with some significant differences as far as the inventory depletion and replenishment are considered. The goal of this work is to understand what makes the car rental problem different and hinders the application of more common methods. To do so, a discrete dynamic programming framework is proposed, with two different approaches to calculate the optimal-value function: one based on a Mixed Integer Non Linear Program (MINLP) and one based on a constraint programming (CP) model. These two approaches are analyzed and relevant insights are derived regarding the (in)ability of discrete dynamic programming to effectively tackle this problem within a rental context when realistically sized instances are considered.

关键词： Car rental Dynamic programming Dynamic pricing Fleet deployment Optimization model constraint programming

来源：评论

学校读者我要写书评

暂无评论

Sustainable refrigerated food transport: searching energy efficient routes

Sustainable refrigerated food transport: searching energy ef...

引用

16th IFAC Symposium on Information Control Problems in Manufacturing (INCOM)

作者： Meneghetti, Antonella Da Rold, Gianluca Cortella, Giovanni Univ Udine Polytech Dept Engn & Architecture Udine Italy

Despite the growing importance of refrigerated food transportation and attention paid to the related sustainability issues, few studies have introduced energy efficiency to guide decision making at operational level. In this research, refrigeration loads are introduced when evaluating fuel consumption for palletized frozen food deliveries from a central refrigerated warehouse, in order to select the best route. In particular, infiltration loads during unloading operations are evaluated basing on the most recent models, as well as transmission loads both during travelling and stops at clients, taking into account changes of outdoor temperatures. A minimum fuel consumption multi-period optimisation model has been developed and solved by constraint programming and then applied to a local network of supermarkets. While the traditional minimum travel distance remains the best solution due to the greater impact of travel requirements on total fuel consumption with respect to refrigeration ones, a preferred direction to run the circuit has been highlighted, depending on the different outdoor temperature of time slots triggered during distribution. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Sustainability Energy efficiency Cold Chain Refrigerated transports Routing constraint programming

来源：评论

学校读者我要写书评

暂无评论

An Approach Based on MCDA and Fuzzy Logic to Select Joint Actions 12th

An Approach Based on MCDA and Fuzzy Logic to Select Joint Ac...

引用

12th International Conference on Scalable Uncertainty Management (SUM)

作者： Imoussaten, Abdelhak Univ Montpellier IMT Mines Ales LGI2P Ales France

ISBN: (纸本)9783030004613;9783030004606

To satisfy a fluctuating demand and achieve a high level of quality and service, companies must take into account several features when designing new products in order to become or remain market leaders. When a single company is unable to meet this objective alone, it is appropriate for it to join its actions with other companies. The product design consists of the complex task to select from various potential actions that allowing the fulfilment of several requirements: functional, technical, environmental, economic, security, etc. Furthermore, the task is even more difficult when actions are related to distinct services or companies that do not necessarily know the capacities of each others which makes complex the coordination of joint actions. Interactions between services may be affected by antagonist personal interests. Based on a multiple criteria decision analysis (MCDA) framework and a fuzzy model that links actions to the satisfaction of objectives, this paper proposes to treat two extreme views related to the collective selection of the necessary actions to design a product: (1) The first point of view corresponds to an ideal situation where each service reveals its capacities and the unique objective is to succeed in the realization of the common goal;(2) the second point of view corresponds to a more realistic situation where only necessary information for the progress of collective action are shared and where collective and personal goals coexist and are to be taken into account. The first situation corresponds to a classical case where a single decision maker (DM) has to express his preferences then a classical optimization problem under constraints has to be solved in order to efficiently select actions. In the second situation the services do not share the same preferences and each service wants to maximize its gain, in this case we propose to build a negotiated solution between services.

关键词： MCDA Fuzzy logic constraint programming Debate modeling

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Production Scheduling with Power-Saving Modes 1

引用

15th International Conference on the Integration of constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Benedikt, Ondrej Sucha, Premysl Modos, Istvan Vlk, Marek Hanzalek, Zdenek Czech Tech Univ Prague Czech Republic Charles Univ Prague Prague Czech Republic

ISBN: (数字)9783319930312

ISBN: (纸本)9783319930312;9783319930305

This study addresses optimization of production processes where machines have high energy consumption. One efficient way to reduce the energy expenses in production is to turn a machine off when it is not being used or switch it into an energy-saving mode. If the production has several machines and production demand that varies in time, the energy saving can be substantial;the cost reduction can be achieved by an appropriate production schedule that could control the switching between the energy modes with respect to the required production volume. Therefore, inspired by real production processes of glass tempering and steel hardening, this paper addresses the scheduling of jobs with release times and deadlines on parallel machines. The objective is to find a schedule of the jobs and a switching between the power modes of the machines so that the total energy consumption is minimized. Moreover, to further generalize the scheduling problem to other production processes, we assume that the processing time of the jobs is mode-dependent, i.e., the processing time of a job depends on the mode in which a machine is operating. The study provides an efficient Branch-and-Price algorithm and compares two approaches (based on Integer Linear programming and constraint programming) for solving the subproblem.

关键词： Production scheduling Energy Branch-and-Price Integer Linear programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共187页 << < 87 88 89 90 91 92 93 94 95 96 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：