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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
32 篇 学位论文

馆藏范围

3,303 篇 电子文献
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,303 篇 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,997 篇 英文
264 篇 其他
29 篇 中文
5 篇 德文
5 篇 法文
5 篇 土耳其文
2 篇 葡萄牙文

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

共 3303 条记录，以下是3151-3160 订阅

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

详细简洁

排序：

Per-node power minimal multicast trees which maximize time-to-first-failure in energy constrained static wireless networks: a 2-step heuristic approach

Per-node power minimal multicast trees which maximize time-t...

引用

MILCOM, Military Communications Conference

作者： A.K. Das P. Arabshahi Department of Electrical Engineering University of Washington Seattle WA USA Jet Propulsion Laboratory Pasadena CA USA

We consider the problem of jointly maximizing the time-to-first-failure (TTFF), defined as the time till the first node in the network runs out of battery energy, and minimizing the total power in energy constrained static wireless networks. It is shown in A.K. Das et al. (2004) that simply optimizing the TTFF criterion may not provide the ideally optimum solution. Besides maximizing the TTFF, the ideally optimum solution guarantees that the lifetimes of all nodes are at least as high as in other trees which provide the same TTFF. A composite objective function involving the TTFF and the sum of the transmitter powers is therefore proposed in A.K. Das et al. (2004), along with a discussion of an optimal solution methodology using mixed integer linear programming. In this paper, we discuss a 2-step heuristic-procedure for the joint optimization problem. The first step is a greedy iterative algorithm which provides an optimal solution, but with respect to the TTFF criterion only. The second step is a tree-improvement technique which is used to refine the TTFF-optimal tree such that the total transmitter power is minimized, without affecting the optimal TTFF. Recent work has shown that the power consumed in the receiver circuitry can be almost comparable to the transmit power, especially in short-range networks. Our algorithms are therefore designed to take into account both the transmitter side and receiver side power expenditures. Simulation results are presented to validate the performance of the algorithm

关键词： Intelligent networks Wireless networks Transmitters Batteries Broadcasting Unicast Multicast algorithms Propulsion mixed integer linear programming Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

A GRASP with Adaptive Memory for a Period Vehicle Routing Problem

A GRASP with Adaptive Memory for a Period Vehicle Routing Pr...

引用

International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce

作者： L.B. Goncalves L.S. Ochi S.L. Martins Departamento de Ciência da Computação Universidade Federal Fluminense Niteroi Rio de Janeiro Brazil

We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem differs from the well-known period vehicle routing problem in several aspects. One major difference between them, responsible for increasing the complexity of the problem, is that, in the proposed problem, the number of visits required by a customer during the period is not previously determined. We developed some pure GRASP heuristics and some other heuristics that include the use of memory in GRASP. Experimental results illustrate the effectiveness of GRASP with adaptive memory over pure GRASP heuristics

关键词： Vehicles Routing Petroleum Costs Production Proposals Finishing mixed integer linear programming Mathematical model Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Optimization models for fixed channel assignment in wireless mesh networks with multiple radios

Optimization models for fixed channel assignment in wireless...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON)

作者： A.K. Das H.M.K. Alazemi R. Vijayakumar S. Roy Department of Electrical Engineering and the Department of Aeronautics and Astronautics University of Washington Seattle WA USA Department of Computer Engineering Kuwait University Kuwait Department of Electrical Engineering University of Washington Seattle WA USA

来源：评论

学校读者我要写书评

暂无评论

A Lagrangian heuristic for bid evaluation in e-procurement auctions

A Lagrangian heuristic for bid evaluation in e-procurement a...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： S. Kameshwaran Y. Narahari ISGMP Bat: A INRIA Lorraine Metz France Department of Computer Science and Automation Indian Institute of Science Bangalore India

e-Procurement is an Internet based business process for sourcing direct or indirect materials. This paper considers a procurement scenario of a buyer procuring large quantities of a single good. The suppliers submit nonconvex piecewise linear supply curves as their bids. Such bids enable the suppliers to effectively express their economies of scale and transportation constraints. The buyer imposes a business rule of limiting the winning suppliers within a preferred range. The bid evaluation problem faced by the buyer is to select the winning suppliers and their trading quantities, such that the cost of procurement is minimized while satisfying the supply, demand, and business constraints. The bid evaluation problem is NP-hard even for a simple special case. In this paper, the problem is formulated as a mixed integer linear programming problem and we propose a Lagrangian relaxation based heuristic to find a near optimal solution. The computational experiments performed on representative data sets show that the proposed heuristic produces a feasible solution with negligible optimality gap.

关键词： Lagrangian functions Procurement Piecewise linear techniques Business Internet Costs Automation Economies of scale Transportation mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Minimizing Market Operation Costs Using A Security-Constrained Unit Commitment Approach

Minimizing Market Operation Costs Using A Security-Constrain...

引用

IEEE/PES Transmission and Distribution Conference and Exhibition: Asia and Pacific

作者： Qin Zhou R. Frowd A. Papalexopoulos D. Lamb E. Ledesma ECCO International Inc. UAE California ISO USA

This paper presents the methodology and the results of the must offer waiver process as applied in the California electricity market. The goal of this cost saving process is to minimize the market operation costs by deploying an optimal unit commitment approach. This procedure replaces the "first come, first served" must offer waiver process that is currently in place. It uses a security constrained unit commitment application to commit enough units to meet the reliability requirement and minimize the total start up and minimum load costs over the specified time period. A post must offer waiver procedure utilizing the security constrained unit commitment is also established to calculate and allocate the incremental costs associated with the local reliability requirement. The key components of the new must offer waiver procedure, the methodology and computer algorithm of security constrained unit commitment, and the methodology of the incremental cost calculation and allocation are addressed in this paper. The paper finally presents computational results based on actual data to illustrate the benefits of the new approach

关键词： Cost function ISO Electricity supply industry Data security Computer security mixed integer linear programming Real time systems Constraint optimization Reliability engineering Load forecasting

来源：评论

学校读者我要写书评

暂无评论

Fast MPLS Network Optimisation using Machine Learning

Fast MPLS Network Optimisation using Machine Learning

引用

IEEE Region 10 International Conference TENCON

作者： Michael J. Dale Herman L. Ferra Robert A. Palmer Telstra Research Laboratories Melbourne VIC Australia

This paper presents the application of a machine learning technique (neural networks) to the problem of optimising the traffic flows (label switched path placement) within telecommunications networks using multi-protocol label switching (MPLS). It is shown here that the machine learning technique achieves very fast computation of accurate solutions to the problem of placing label switched paths in order to maximise the performance of the network. Results are presented which compare the accuracy of the neural network solutions with the optimal solutions produced by the standard mixed integer linear programming technique, and the time taken to produce the solutions. As well, network simulation results are presented which show the improvement in network performance, in terms of packet loss, that can be achieved when using such a technique.

关键词： Multiprotocol label switching Machine learning Telecommunication traffic Neural networks Telecommunication switching mixed integer linear programming Laboratories Australia Computer networks Telecommunication computing

来源：评论

学校读者我要写书评

暂无评论

Link scheduling with power control for throughput enhancement in multihop wireless networks

Link scheduling with power control for throughput enhancemen...

引用

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： Jian Tang Guoliang Xue C. Chandler Weiyi Zhang Department of Computer Science and Engineering Arizona State University Tempe AZ USA

Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusing on maximizing the network throughput. We formulate the maximum throughput link scheduling with power control (MATH-SPC) problem, and present a mixed integer linear programming (MILP) formulation to provide optimal solutions. However, simply maximizing the throughput leads to a severe bias on bandwidth allocation among all links. In order to enhance both throughput and fairness, we define a new parameter, the demand satisfaction factor (DSF), to characterize the fairness of bandwidth allocation. We formulate the maximum throughput fair link scheduling with power control (MATA-SPC) problem and present an MILP formulation for this problem. We also present an effective polynomial time heuristic algorithm, namely, the serial LP rounding (SLPR) heuristic. Our numerical results show that bandwidth can be fairly allocated among all links/flows by solving our MATA-SPC formulation or using our heuristic algorithm at the cost of a minor reduction of network throughput

关键词： Power control Throughput Spread spectrum communication Wireless networks Channel allocation Heuristic algorithms mixed integer linear programming Polynomials Bandwidth Costs

来源：评论

学校读者我要写书评

暂无评论

Real Time Trajectory Planning for UAVs Using MILP

Real Time Trajectory Planning for UAVs Using MILP

引用

IEEE Conference on Decision and Control

作者： W.A. Kamal Da-Wei Gu I. Postlethwaite Control and Instrumentation Group Department of Engineering University of Leicester Leicester UK

A probabilistic finite receding horizon approach for trajectory planning of autonomous air vehicles is presented. The approach is based on mixed integer linear programming (MILP) techniques. The risk areas are modelled by dynamic boundaries to direct the vehicle towards the target. Various constraints are formulated to avoid radar zones and collisions, etc. These constraints are extended to be both hard and soft so as to alleviate the infeasibility problem usually encountered. The finite receding horizon approach is numerically stable and can be applied to centralized trajectory planning of a fleet of UAVs in real time. The MILP problem is solved using commercially available software AMPL/CPLEX. Finally the approach is applied to different scenarios with upper and lower bounds on the speed and acceleration of each UAV.

关键词： Trajectory Unmanned aerial vehicles Radar Remotely operated vehicles mixed integer linear programming Vehicle dynamics Cost function Instruments Automotive engineering Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Global and local QoS constraints guarantee in Web service selection

Global and local QoS constraints guarantee in Web service se...

引用

IEEE International Conference on Web Services (ICWS)

作者： D. Ardagna B. Pernici Politecnico di Milano Italy

In service oriented architectures, complex applications are composed from a variety of functionally equivalent Web services, which may differ for quality parameters. Under this scenario, applications are defined as high level business processes and service composition can be implemented dynamically by identifying the best set of services available at run time. In this paper, we model the service composition problem as a mixed integer linear problem where both local constraints and global constraints can be specified.

关键词： Web services Quality of service Service oriented architecture Constraint optimization Information retrieval mixed integer linear programming Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Formulation of optimal tree construction for maximum lifetime multicasting in wireless ad-hoc networks with adaptive antennas

Formulation of optimal tree construction for maximum lifetim...

引用

IEEE International Conference on Communications (ICC)

作者： Song Guo O. Yang School of Information Technology and Engineering University of Ottawa Ottawa Canada

We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We present a constraint formulation for the MLM (multicast lifetime maximization) problem in terms of MILP (mixed integer linear programming) for wireless ad hoc networks, which we can use to evaluate and compare the realistic performance of different heuristic algorithms.

关键词： Ad hoc networks Adaptive systems Adaptive arrays Wireless networks Directional antennas Energy resources mixed integer linear programming Mobile ad hoc networks Heuristic algorithms Multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共331页 << < 312 313 314 315 316 317 318 319 320 321 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：