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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,947 篇 期刊文献
1,324 篇 会议
33 篇 学位论文

馆藏范围

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

日期分布

学科分类号

2,290 篇 工学
- 736 篇 计算机科学与技术...
- 707 篇 电气工程
- 434 篇 石油与天然气工程
- 270 篇 动力工程及工程热...
- 221 篇 机械工程
- 212 篇 控制科学与工程
- 189 篇 化学工程与技术
- 178 篇 信息与通信工程
- 127 篇 交通运输工程
- 118 篇 航空宇航科学与技...
- 85 篇 土木工程
- 76 篇 环境科学与工程（可...
- 74 篇 软件工程
- 63 篇 仪器科学与技术
- 43 篇 力学（可授工学、理...
- 34 篇 电子科学与技术（可...
- 28 篇 建筑学
- 21 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 水利工程
784 篇 管理学
- 767 篇 管理科学与工程(可...
- 128 篇 工商管理
470 篇 理学
- 341 篇 数学
- 36 篇 物理学
- 34 篇 系统科学
- 30 篇 生物学
- 23 篇 化学
- 13 篇 统计学（可授理学、...
183 篇 经济学
- 131 篇 应用经济学
- 50 篇 理论经济学
25 篇 农学
19 篇 医学
9 篇 法学
5 篇 教育学
4 篇 军事学
3 篇 文学
2 篇 艺术学
1 篇 哲学

主题

3,304 篇 mixed integer li...
339 篇 optimization
167 篇 costs
143 篇 linear programmi...
125 篇 scheduling
90 篇 uncertainty
87 篇 planning
87 篇 computational mo...
81 篇 routing
63 篇 genetic algorith...
62 篇 unit commitment
61 篇 renewable energy...
59 篇 integer programm...
56 篇 transportation
55 篇 resource managem...
54 篇 energy consumpti...
54 篇 production
53 篇 mathematical mod...
51 篇 demand response
50 篇 heuristic algori...

机构

12 篇 carnegie mellon ...
10 篇 huazhong univ sc...
8 篇 dalian univ tech...
8 篇 nanyang technol ...
8 篇 beijing jiaotong...
7 篇 aristotle univ t...
7 篇 liaocheng univ s...
6 篇 northwestern pol...
6 篇 univ lisbon inst...
6 篇 department of el...
6 篇 shiraz univ tech...
6 篇 georgia inst tec...
6 篇 universidade est...
5 篇 univ liege dept ...
5 篇 tongji univ sch ...
5 篇 korea adv inst s...
5 篇 shanghai univ sc...
5 篇 jet propulsion l...
5 篇 univ hong kong d...
5 篇 huazhong univ sc...

作者

17 篇 papageorgiou laz...
11 篇 biskas pandelis ...
11 篇 montemanni rober...
11 篇 rider marcos j.
10 篇 ho koki
9 篇 d'amore federico
9 篇 bezzo fabrizio
9 篇 artigues christi...
8 篇 meng leilei
8 篇 koltsaklis nikol...
8 篇 magatao leandro
8 篇 marechal francoi...
8 篇 ahn jaemyung
8 篇 zhang chaoyong
8 篇 tuncer t. engin
8 篇 bakirtzis anasta...
8 篇 barbosa-povoa an...
7 篇 tan raymond r.
7 篇 cheng chuntian
7 篇 grossmann ignaci...

语言

2,998 篇 英文
264 篇 其他
29 篇 中文
5 篇 德文
5 篇 法文
5 篇 土耳其文
2 篇 葡萄牙文

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

共 3304 条记录，以下是3111-3120 订阅

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

详细简洁

排序：

Supply Network Modeling using Process Graph Theory: A Framework for Analysis

Supply Network Modeling using Process Graph Theory: A Framew...

引用

SICE Annual Conference

作者： Young Kim Sunwon Park Department of Chemical and Biomolecular Engineering KAIST Daejeon South Korea

Supply network modeling normally involves large scale and is often highly complex to be defined. Existing methods such as mixed integer linear programming solve the problems of simple decision or of moderate scale, but cannot manage the large scale realistic problems. In addition, they cannot provide alternative solution in case that the optimum solution cannot be applied in real business for various reasons. In this study, graphical representation of supply networks is studied for process graph modeling of a hypothetical example. The proposed graphical approach is expected to overcome these weaknesses of mixed integer programming. It endows visibility to the networks and a set of feasible solutions in the changing business environment

关键词： Graph theory Large-scale systems Chemical processes Biochemical analysis Chemical analysis Chemical engineering Electronic mail mixed integer linear programming linear programming Supply chains

来源：评论

学校读者我要写书评

暂无评论

Slack matching asynchronous designs

Slack matching asynchronous designs

引用

International Symposium on Advanced Research in Asynchronous Circuits and Systems

作者： P.A. Beerel A. Lines M. Davies Nam-Hoon Kim University of Southern California Los Angeles CA USA Fulcrum Microsystems Inc. Calabasas CA USA

Slack matching is the problem of adding pipeline buffers to an asynchronous pipelined design in order to prevent stalls and improve performance. This paper addresses the problem of minimizing the cost of additional pipeline buffers needed to achieve a given performance target. An intuitive analysis is given that is then formalized using marked graph theory. This leads to a mixed integer linear programming (MILP) solution of the problem. Theory is then presented that identifies under what circumstances the MILP solution admits a polynomial time solution. For other circumstances, a polynomial-time approximate algorithm using linear programming is proposed. Experimental results on a large set of benchmark circuits demonstrate the computational feasibility and effectiveness of both approaches

关键词： Pipeline processing Polynomials linear programming Asynchronous circuits Clustering algorithms Optimization methods Costs Graph theory mixed integer linear programming linear approximation

来源：评论

学校读者我要写书评

暂无评论

Algorithmic truncation of minimax polynomial coefficients

Algorithmic truncation of minimax polynomial coefficients

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： S.A. Tawfik H.A.H. Fahmy ECE Department University of Wisconsin Madison USA Electronics and Communications Department Faculty of Engineering Cairo University Giza Egypt School of Computer Engineering Nanyang Technological University Singapore

Elementary and high-level functions can be computed in hardware using polynomial approximation techniques. There are many techniques in the literature to calculate the coefficients of such polynomials. Remez algorithm as presented by Veidinger (1960) provides the optimal polynomial in the Chebyshev sense that is minimizing the maximum error (minimax approximation). This paper presents an algorithm for truncating the coefficients of the minimax polynomials obtained from Remez algorithm using an algorithmic method. A gain of 3 and 4 bits of accuracy over the direct rounding is reported. Muller addressed the same problem but his algorithm is applicable for the second order polynomials only. This paper presents an algorithm that is applicable for any order

关键词： Minimax techniques Polynomials Chebyshev approximation Iterative algorithms Approximation algorithms Hardware Cost function Equations mixed integer linear programming Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

WLC30-2: Channel Assignment and Routing for Multi-Channel Wireless Mesh Networks Using Simulated Annealing

WLC30-2: Channel Assignment and Routing for Multi-Channel Wi...

引用

IEEE Globecom 2006

作者： Ying-Yu Chen Shang-Chun Liu Chien Chen Department of Computer Science National Chiao Tung University Hsinch Taiwan R.O.C

Wireless mesh networks (WMNs) are emerging as a favorable technology for last-mile Internet access. Nodes in WMNs can be equipped with multiple interfaces which work in different channels to increase the available bandwidth. However, efficient channel assignment schemes are still needed due to the interference effect and the limited number of orthogonal channels. In this paper, we consider the channel assignment and routing for dynamic traffic in WMNs. We adopt the static channel assignment strategy to the network interfaces. The problem is simplified into two sequential stages. The first is to assign channels to interfaces while the second is to determine the route for each coming traffic demand. We propose a mixed integer linear programming (MILP) formulation to the problem and develop a simulated annealing based channel assignment algorithm for the channel assignment. The shortest path routing is adopted for the dynamic traffic. Simulation results show the network throughput and blocking probability under different network scenarios.

关键词： Routing Wireless mesh networks Simulated annealing Telecommunication traffic Traffic control IP networks Bandwidth Interference Network interfaces mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A hierarchical optimization algorithm for cooperative vehicle networks

A hierarchical optimization algorithm for cooperative vehicl...

引用

American Control Conference (ACC)

作者： C. Branca R. Fierro MARHES Lab School of Electrical and Computer Engineering Oklahoma State University Stillwater OK USA

In this paper, we combine model predictive control (MPC) and mixed integer linear programming (MILP) into a hierarchical optimization framework capable of solving a class of coordination problems in multi-vehicle networks. A critical issue in MPC/MILP applications is that the underlying optimization problem must be solved on-line. This introduces a time constraint that is hard to meet when the number of vehicles and the number of obstacles increase. To alleviate this problem, we implement some heuristics that significantly improve the efficiency of the proposed hierarchical, decentralized optimization scheme. Numerical simulations verify the scalability of the algorithm to the number of vehicles and complexity of the environment

关键词： Vehicles Robot kinematics Predictive models Predictive control mixed integer linear programming Scalability Cost function Time factors Numerical simulation Multirobot systems

来源：评论

学校读者我要写书评

暂无评论

Route optimization for efficient failure recovery in optical burst switched networks

Route optimization for efficient failure recovery in optical...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Qian Chen G. Mohan K.C. Chua Department of Electrical and Computer Engineering National University of Singapore Singapore

We consider the problem of offline route optimization for failure recovery in optical burst switched (OBS) networks. The primary and backup paths for each flow are determined in such a way to minimize the expected burst loss over normal and failure states. When a failure occurs, the affected traffic are transferred to the pre-configured backup path, resulting in fast recovery. Our route selection is efficient because we consider the unique features of OBS networks such as streamline effect. We argue that route selection based on Erlang B formula is not accurate because of this effect. We analyze the streamline effect and propose a more accurate loss estimation formula which takes the streamline effect into consideration. Based on this formula, we develop a mixed integer linear programming (MILP) formulation. Since the MILP-based solution is computationally intensive, we develop a heuristic algorithm. We verify the effectiveness of our algorithms through numerical results obtained by solving the MILP formulation with CPLEX and also through simulation results

关键词： Intelligent networks Optical fiber networks Telecommunication traffic Optical losses Traffic control mixed integer linear programming Heuristic algorithms Computational modeling Optical burst switching Communication system traffic control

来源：评论

学校读者我要写书评

暂无评论

Using MILP for UAVs Trajectory Optimization under Radar Detection Risk

Using MILP for UAVs Trajectory Optimization under Radar Dete...

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Jose J. Ruz Orlando Arevalo Jesus M. de la Cruz Gonzalo Pajares Department of Computer Architecture and Automatic Control Universidad Complutense de Madrid Spain Department of Software Engineering and Artificial Intelligence Universidad Complutense de Madrid Spain

This paper presents an approach to trajectories optimization for unmanned aerial vehicle (UAV) in presence of obstacles, waypoints, and threat zones such as radar detection regions, using mixed integer linear programming (MILP). The main result is the linear approximation of a nonlinear radar detection risk function with integer constraints and indicator 0-1 variables. Several results are presented to show that the approach can yields trajectories depending on the acceptable risk of detection.

关键词： Radar detection Unmanned aerial vehicles Radar cross section mixed integer linear programming Constraint optimization Humans Missiles Turning Computer architecture Automatic control

来源：评论

学校读者我要写书评

暂无评论

Path Planning Methods for Adaptive Sampling of Environmental and Acoustical Ocean Fields

Path Planning Methods for Adaptive Sampling of Environmental...

引用

OCEANS

作者： Namik Kemal Yilmaz Constantinos Evangelinos Nicholas M. Patrikalakis Pierre F. J. Lermusiaux Patrick J. Haley Wayne G. Leslie Allan R. Robinson Ding Wang Henrik Schmidt Department of Mechanical Engineering Massachusetts Institute of Technology Cambridge MA USA Massachusetts Institute of Technology Cambridge MA Harvard University Cambridge MA USA

Adaptive sampling aims to predict the types and locations of additional observations that are most useful for specific objectives, under the constraints of the available observing network. Path planning refers to the computation of the routes of the assets that are part of the adaptive component of the observing network. In this paper, we present two path planning methods based on mixed integer linear programming (MILP). The methods are illustrated with some examples based on environmental ocean fields and compared to highlight their strengths and weaknesses. The stronger method is further demonstrated on a number of examples covering multi-vehicle and multi-day path planning, based on simulations for the Monterey Bay region. The framework presented is powerful and flexible enough to accommodate changes in scenarios. To demonstrate this feature, acoustical path planning is also discussed

关键词： Path planning Sampling methods Oceans Uncertainty Marine technology Computer networks Vehicles Sea measurements Mechanical engineering mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

The capacitated vehicle routing problem with reloads

The capacitated vehicle routing problem with reloads

引用

International Conference on Services Systems and Services Management, ICSSSM

作者： Herve Kerivin Mathieu Lacroix Ali Ridha Mahjoub Alain Quilliot LIMOS CNRS UMR 6158 Universite Blaise Pascal Clermont Ferrand France

In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational results

关键词： Vehicles Routing Postal services Costs Road transportation Rail transportation mixed integer linear programming Operations research Air transportation Aircraft

来源：评论

学校读者我要写书评

暂无评论

WLC35-3: Survivable Wireless Access Network Design with Dual-homing Capabilities

WLC35-3: Survivable Wireless Access Network Design with Dual...

引用

IEEE Globecom 2006

作者： Mohammad Masud Hasan Xiaodong Huang Jason P. Jue Department of Computer Science University of Texas Dallas Richardson TX USA

With the growth of mobile users and the increasing deployment of wireless access network infrastructures, the issue of quality of service is becoming an important component of efficient wireless access network design. In this paper, we study the survivability problem for users that are connected to the core network by fully or partially dual homed paths, or by a single path. Given a hierarchical wireless access network with the available capacity and reliability at each level, the problem is to minimize overall connection cost for multiple requests such that the capacity and minimum survivability requirements are not violated. We formulate the problem using mixed integer linear programming and propose a genetic-algorithm-based heuristic.

关键词： Wireless networks Femtocell networks Costs Databases Network topology Switches Computer science Mobile computing Quality of service mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共331页 << < 308 309 310 311 312 313 314 315 316 317 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：