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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,009 篇 期刊文献
1,889 篇 会议
32 篇 学位论文
4 篇 资讯

馆藏范围

3,934 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,544 篇 工学
- 1,690 篇 计算机科学与技术...
- 829 篇 电气工程
- 677 篇 软件工程
- 430 篇 信息与通信工程
- 210 篇 控制科学与工程
- 149 篇 电子科学与技术（可...
- 105 篇 交通运输工程
- 104 篇 机械工程
- 74 篇 土木工程
- 49 篇 石油与天然气工程
- 36 篇 建筑学
- 34 篇 仪器科学与技术
- 28 篇 测绘科学与技术
- 26 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 力学（可授工学、理...
- 24 篇 动力工程及工程热...
- 22 篇 环境科学与工程（可...
1,191 篇 理学
- 986 篇 数学
- 109 篇 物理学
- 79 篇 生物学
- 67 篇 系统科学
- 57 篇 统计学（可授理学、...
- 12 篇 化学
616 篇 管理学
- 587 篇 管理科学与工程(可...
- 80 篇 工商管理
- 17 篇 图书情报与档案管...
116 篇 经济学
- 86 篇 应用经济学
- 23 篇 理论经济学
41 篇 医学
- 17 篇 临床医学
29 篇 农学
13 篇 法学
10 篇 教育学
9 篇 文学
6 篇 艺术学
3 篇 军事学

主题

3,934 篇 integer linear p...
226 篇 optimization
225 篇 linear programmi...
170 篇 routing
164 篇 costs
114 篇 processor schedu...
113 篇 heuristic algori...
92 篇 scheduling
90 篇 computer science
89 篇 bandwidth
85 篇 energy consumpti...
79 篇 algorithm design...
77 篇 testing
75 篇 cost function
74 篇 resource managem...
72 篇 optical fiber ne...
71 篇 constraint optim...
71 篇 computational mo...
71 篇 telecommunicatio...
70 篇 delay

机构

12 篇 xidian univ sch ...
11 篇 macau univ sci &...
11 篇 naval postgradua...
10 篇 duke univ dept e...
9 篇 kyoto univ grad ...
9 篇 southwest jiaoto...
8 篇 nanyang technol ...
8 篇 kyoto univ grad ...
7 篇 beijing jiaotong...
7 篇 tech univ munich...
6 篇 macau univ sci &...
6 篇 wright state uni...
6 篇 polytech bari de...
6 篇 department of el...
6 篇 kyoto univ kyoto
6 篇 kyoto university...
6 篇 consejo nacl inv...
6 篇 univ massachuset...
6 篇 department of el...
5 篇 new jersey inst ...

作者

27 篇 oki eiji
18 篇 li zhiwu
15 篇 dao thanh hai
14 篇 sato takehiro
13 篇 de sousa amaro
12 篇 santos dorabella
11 篇 fanti maria pia
11 篇 delorme xavier
10 篇 hanzalek zdenek
10 篇 eiji oki
9 篇 maria pia fanti
9 篇 picelli renato
9 篇 dolgui alexandre
9 篇 mangini agostino...
9 篇 tomiyama hiroyuk...
9 篇 gouveia luis
8 篇 dauzere-peres st...
8 篇 soumya j.
8 篇 righini giovanni
8 篇 gomes teresa

语言

3,535 篇 英文
365 篇 其他
26 篇 中文
3 篇 土耳其文
2 篇 葡萄牙文
1 篇 西班牙文

检索条件"主题词=integer linear programming"

共 3934 条记录，以下是501-510 订阅

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

详细简洁

排序：

On the Trade-off between the Maximum Capacity and the Length of a Multicore Fiber Link 24

On the Trade-off between the Maximum Capacity and the Length...

引用

24th International Conference on Transparent Optical Networks (ICTON)

作者： de Sousa, Amaro Lechowicz, Piotr Univ Aveiro DETI Inst Telecomunicacoes Aveiro Portugal Chalmers Univ Technol Elect Engn Dept Gothenburg Sweden

ISBN: (纸本)9798350377330;9798350377323

The transmission capacity of a multicore fiber (MCF) link is the sum of the capacities of its cores, but the capacity of each core depends not only on the modulation format (MF) and baud rate (BR) of the lightpaths established through the core but also on the inter-core crosstalk (XT) impairments imposed by the adjacent cores in use. For a MCF link of a given length, we propose a Binary linear programming formulation to determine the MF and the BR to use on each core, aiming to reach the MCF maximum capacity. Comparing the maximum capacity of a 19-core MCF with the single core fiber counterpart, the influence of the link length on the MCF capacity scaling factor reached by MCFs is characterized.

关键词： multicore optical fiber inter-core crosstalk optimization integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On the Resource Allocation and User Association in Future Multi-Band Wireless Networks 99

On the Resource Allocation and User Association in Future Mu...

引用

IEEE 99th Vehicular Technology Conference (VTC-Spring)

作者： Darouich, Feres Chaieb, Cirine Ajib, Wessam Abdelkefi, Fatma Univ Quebec Montreal Montreal PQ Canada Higher Sch Commun Tunis Aryanah Tunisia

ISBN: (纸本)9798350387414

In response to the challenges of spectrum scarcity and the exponential growth of the number of connected devices, this paper addresses the joint optimization problem of user-base station association, channel assignment and power allocation in a multi-band wireless network, where sub-6 GHz, millimeter wave, and terahertz frequency bands coexist. The problem is formulated as a mixed integer non-linear programming, a known NP-hard problem. Each user requests both a minimum data rate and a minimum reliability level defined by a signal-to-noise ratio. Considering the goal of optimizing the number of satisfied users, this paper proposes a multi-agent deep reinforcement learning solution. Simulation results convincingly demonstrate the effectiveness of our proposed algorithm and its ability to learn fast the best resource allocation solution.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Sparse Nonlinear Dynamic Identification of a Single-Phase Flow System 20

Sparse Nonlinear Dynamic Identification of a Single-Phase Fl...

引用

IEEE 20th International Conference on Automation Science and Engineering (CASE)

作者： Miyatake, Luis Camponogara, Eduardo Seman, Laio Univ Fed Santa Catarina Dept Automat & Syst Engn Florianopolis SC Brazil

ISBN: (纸本)9798350358513;9798350358520

This study presents a sparse identification approach for modeling dynamic systems, leveraging data from a transient multiphase flow simulator, OLGA. The Sparse Identification of Nonlinear Dynamics (SINDy) methodology is applied, employing two optimization methods: Sequential Thresholded Least Squares (STLS) and a Mixed-integer linear programming (MILP)-based approach. The MILP-based method, featuring a cardinality constraint, represents a pioneering advancement in system identification techniques. Key findings include the importance of variable normalization for model accuracy, the role of cross-validation in hyperparameter selection for optimal model structure, and the exploration of the trade-off between sparsity and generalization. Results obtained for a reference case of transient water flow subject to many boundary conditions (or controls) validate the identified model's ability to represent observed data in OLGA accurately.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

DOT: Towards Fast Decision Tree Packet Classification by Optimizing Rule Partitions 49

DOT: Towards Fast Decision Tree Packet Classification by Opt...

引用

49th Conference on Local Computer Networks

作者： Huang, Long Zhu, Longlong Yu, Jiashuo Chen, Xinyang Zheng, Linying Zhang, Dong Wu, Chunming Fuzhou Univ Coll Comp & Data Sci Fuzhou Peoples R China Quan Cheng Lab Jinan Peoples R China Fuzhou Univ Zhicheng Coll Fuzhou Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou Peoples R China

ISBN: (纸本)9798350388015;9798350388008

Packet classification is a crucial component of modern networks. Existing decision tree-based algorithms alleviate the rule replication problem caused by overlapping rules in the ruleset via rule partitioning. They partition the ruleset into multiple subsets based on rule characteristics to reduce rule overlaps. However, existing algorithms fail to address the overlap between rules in the same set, seriously decreasing speed and memory performance. In this paper, we propose DOT, a framework for optimizing rule partitions before constructing decision trees. Its key idea is to migrate rules in subsets based on rule overlaps and the features of heuristics used to construct trees, as well as reorganize rules aided by tuples. DOT finds out the migrated rule candidates using rule dependency graphs and heuristic features, then transforms the rule migration problem into an integer linear programming problem and solves for the optimal migration strategy. Further, we employ a tuple-assisted approach to accelerate rule matching. Experiments show that DOT enhances existing decision tree-based algorithms, improving lookup speed by 1.69 x, reducing average 24.85% memory consumption and 31.03% decision tree depth.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Scalable Double-Oracle Algorithm for Multi-Domain Deception Game

A Scalable Double-Oracle Algorithm for Multi-Domain Deceptio...

引用

IEEE Conference on Communications and Network Security (CNS)

作者： Asghar, Ahmed Bilal Hemida, Ahmed Kamhoua, Charles Kleinberg, Jon DEVCOM Army Res Lab Network Secur Branch Adelphi MD 20783 USA Cornell Univ Comp Sci Ithaca NY USA

ISBN: (纸本)9798350375978;9798350375961

This paper considers a multi-layer game representing a cyber-physical system where a defender must protect a set of resources from an adversary. The defender employs deceptive actions in both the cyber and physical domains. The two domains are interconnected, and the players' payoffs depend on their actions across both domains. We investigate the complexity of this multi-domain game and use a double oracle approach to solve it, presenting integer linear programs for the player oracles. Due to the high dimensionality of the defender's combined action space, the game becomes intractable even for medium-sized networks. Therefore, we propose a heuristic defender oracle to solve large-scale problems efficiently. Our simulations validate that the proposed method can efficiently solve large-scale problems. Numerical results demonstrate that by using the heuristic oracle, the defender's payoff is, on average, within 16% of the optimal solution for random problem instances.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Admission Control and Embedding of Network Slices with Flexible VNF Order 20

Admission Control and Embedding of Network Slices with Flexi...

引用

20th International Conference on Network and Service Management

作者： Quang-Trung Luu Minh-Thanh Nguyen Tai-Hung Nguyen Kieffer, Michel Van-Dinh Nguyen Quang-Lap Luu Trung-Toan Nguyen Hanoi Univ Sci & Technol Sch Elect & Elect Engn Hanoi 100000 Vietnam Univ Paris Saclay CNRS Cent Supelec L2S F-91192 Gif Sur Yvette France VinUniv Coll Engn & Comp Sci Vinhomes Ocean Pk Hanoi 100000 Vietnam VinUniv Ctr Environm Intelligence Vinhomes Ocean Pk Hanoi 100000 Vietnam

ISBN: (纸本)9798331505158;9783903176669

Network slicing has appeared a key feature in 5G and beyond communication networks that enables the creation of multiple virtual networks (i.e., slices) over a shared physical network infrastructure. This process involves efficiently embedding (or mapping) each slice element, including virtual network functions (VNFs) and their interconnections, onto the physical network. This paper explores a scenario where the order of VNFs can be adjusted during slice embedding, offering greater flexibility to increase the number of services deployed on the infrastructure. We formulate a novel optimization framework to tackle the challenges of slice admission control and embedding with this flexibility. A heuristic is also introduced to derive embedding solutions in a timely manner. Simulation results demonstrate that allowing flexible VNF ordering significantly increases the number of slices that can be deployed in the network infrastructure.

关键词： Network slicing admission control slice embedding resource allocation 5G and beyond flexible order open radio access network integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems 65

Sensitivity, Proximity and FPT Algorithms for Exact Matroid ...

引用

65th Symposium on Foundations of Computer Science

作者： Eisenbrand, Friedrich Rohwedder, Lars Wegrzycki, Karol Ecole Polytech Fed Lausanne Sch Basic Sci Lausanne Switzerland Maastricht Univ Sch Business & Econ Maastricht Netherlands Saarland Univ Saarbrucken Germany MPI Informat Saarbrucken Germany

ISBN: (纸本)9798331516758;9798331516741

We consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from {-Delta, ... , Delta} or more generally m-dimensional vectors of such discrete values. We resolve the parameterized complexity completely, by presenting an FPT algorithm parameterized by Delta and m for arbitrary matroids. Prior to our work, no such algorithms were known even when weights are in {0, 1}, or arbitrary Delta and m = 1. Our main technical contributions are new proximity and sensitivity bounds for matroid problems, independent of the number of elements. These bounds imply FPT algorithms via matroid intersection.

关键词： polyhedral combinatorics integer linear programming matroid basis

来源：评论

学校读者我要写书评

暂无评论

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of linear integer Arithmetic 16

Completeness Theorems for k-SUM and Geometric Friends: Decid...

引用

16th Innovations in Theoretical Computer Science Conference, ITCS 2025

作者： Gokaj, Geri Künnemann, Marvin Karlsruhe Institute of Technology Germany

ISBN: (纸本)9783959773614

In the last three decades, the k-SUM hypothesis has emerged as a satisfying explanation of longstanding time barriers for a variety of algorithmic problems. Yet to this day, the literature knows of only few proven consequences of a refutation of this hypothesis. Taking a descriptive complexity viewpoint, we ask: What is the largest logically defined class of problems captured by the k-SUM problem? To this end, we introduce a class FOPZ of problems corresponding to deciding sentences in Presburger arithmetic/linear integer arithmetic over finite subsets of integers. We establish two large fragments for which the k-SUM problem is complete under fine-grained reductions: 1. The k-SUM problem is complete for deciding the sentences with k existential quantifiers. 2. The 3-SUM problem is complete for all 3-quantifier sentences of FOPZ expressible using at most 3 linear inequalities. Specifically, a faster-than-n⌈k/2⌉±o(1) algorithm for k-SUM (or faster-than-n2±o(1) algorithm for 3-SUM, respectively) directly translate to polynomial speedups of a general algorithm for all sentences in the respective fragment. Observing a barrier for proving completeness of 3-SUM for the entire class FOPZ, we turn to the question which other – seemingly more general – problems are complete for FOPZ. In this direction, we establish FOPZ-completeness of the problem pair of Pareto Sum Verification and Hausdorff Distance under n Translations under the L∞/L1 norm in Zd. In particular, our results invite to investigate Pareto Sum Verification as a high-dimensional generalization of 3-SUM. © Geri Gokaj and Marvin Künnemann.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Solution Approach Based on Complementary Constraints and the Transformer Model with a Dummy Node for Dynamic Reactive Power Optimization 9th

A Two-Stage Solution Approach Based on Complementary Constra...

引用

9th Purple Mountain Form on Smart Grid Protection and Control, PMF 2024

作者： Huang, Hua Xu, Taishan Gao, Zonghe Dai, Zemei Chen, Tianhua Bo, Lin Lu, Jinjun Tu, Mengfu State Key Laboratory of Technology and Equipment for Defense Against Power System Operational Risks Jiangsu Nanjing211106 China NARI Technology Co. Ltd. Jiangsu Nanjing211106 China Jiangsu Nanjing211106 China

ISBN: (纸本)9789819616701

A two-stage solution approach based on complementary constraints and The Transformer Model with A Dummy Node is proposed to efficiently solve the large-scale nonlinear dynamic reactive power optimization (DRPO) problem with multi-period period coupled absolute value constraints and integer variables. The model for DRPO problem is represented by adding the voltage of the dummy nodes in the on-load tap changer transformer model to express the power and voltage relations firstly. Then the multi-period coupled absolute value constraints in the model are relaxed by linearization method, and the original model is respectively converted into a continuous mathematical programming model with complementary constraints based on complementary conditions and equivalent conversion of discrete variables. The solution steps are decomposed into two stages which are solved by the interior point method sequentially. In the first stage, the approximate optimization solution for discrete variables is quickly obtained without considering complementary constraints. And in the second stage, the complete model with complementary constraints is solved to obtain accurate optimization solutions for both discrete and continuous variables. Furthermore, a sparse storage and fast calculation method is proposed to reduce the computational complexity of the integrated Hessian matrix during the iteration of the interior point method. The simulation results of standard test systems such as IEEE 118-bus demonstrate the effectiveness and efficiency of the proposed approach. © State Grid Electric Power 2025.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Nonlinear integer Planning Three-Dimensional Crate Model Based on Hybrid Genetic Algorithm 14th

Nonlinear Integer Planning Three-Dimensional Crate Model Bas...

引用

14th International Conference on Frontier Computing, FC 2024

作者： Li, Meichen Zhang, Shiyuan Bao, Haohan College of Mathematics and Physics Beijing University of Chemical Technology Beijing China College of Economics and Management Beijing University of Chemical Technology Beijing China

ISBN: (纸本)9789819623907

China’s express delivery industry has boomed in recent years, with the number of new parcels added each year now exceeding half of the overall U.S. express delivery volume, reaching 100 billion. China has established the most powerful and advanced express logistics system in the world. In the parcel packing process, the selection of appropriate packaging consumables is crucial, because the large scale of parcel quantity reduces the cost of each parcel consumable and brings great economic benefits. In the study, data preprocessing was first carried out to eliminate goods that were too large to be packed. Then, the problem was identified as 0–1 nonlinear integer programming, and the constrained planning problem was transformed into an unconstrained problem by means of an objective function, constraints, and introduction of weights to optimise the planning using a genetic algorithm. However, testing revealed that the genetic algorithm is prone to falling into local optimum, so a hybrid heuristic algorithm is used for the final optimisation, which is combined with a simulated annealing algorithm to avoid falling into local optimum. In Matlab programming, the algorithm is programmed for goods based on order grouping. In dealing with the cargo placement problem, two placement rules are provided for boxes and bags. For the size optimisation problem, the optimal solution for each covariate is computed and used as a replacement set for nonlinear programming. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：