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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,034 篇 会议
678 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

10,726 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,356 篇 工学
- 1,158 篇 计算机科学与技术...
- 846 篇 电气工程
- 661 篇 信息与通信工程
- 293 篇 软件工程
- 275 篇 电子科学与技术（可...
- 220 篇 控制科学与工程
- 199 篇 仪器科学与技术
- 151 篇 机械工程
- 59 篇 交通运输工程
- 24 篇 材料科学与工程（可...
- 23 篇 网络空间安全
- 21 篇 石油与天然气工程
- 17 篇 光学工程
- 16 篇 动力工程及工程热...
- 15 篇 航空宇航科学与技...
- 7 篇 土木工程
- 6 篇 测绘科学与技术
- 4 篇 化学工程与技术
252 篇 管理学
- 247 篇 管理科学与工程(可...
- 6 篇 工商管理
- 6 篇 图书情报与档案管...
172 篇 理学
- 67 篇 系统科学
- 58 篇 物理学
- 30 篇 数学
- 15 篇 化学
- 9 篇 生物学
48 篇 文学
- 48 篇 新闻传播学
16 篇 医学
- 12 篇 临床医学
9 篇 经济学
- 7 篇 应用经济学
9 篇 军事学
- 9 篇 军队指挥学
5 篇 教育学
1 篇 法学

主题

10,726 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,646 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,302 篇 resource managem...
1,301 篇 real time system...
1,291 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
968 篇 job shop schedul...
945 篇 dynamic scheduli...
782 篇 costs
735 篇 telecommunicatio...
691 篇 switches
677 篇 optimal scheduli...
588 篇 application soft...
582 篇 heuristic algori...
520 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
29 篇 department of co...
26 篇 department of co...
24 篇 department of co...
24 篇 school of electr...
23 篇 department of co...
22 篇 department of co...
22 篇 department of co...
22 篇 mitre corporatio...
22 篇 beijing universi...
21 篇 institute of com...
19 篇 department of el...
19 篇 bell laboratorie...
18 篇 department of el...

作者

30 篇 m. hamdi
26 篇 tei-wei kuo
25 篇 e. leonardi
21 篇 e.h.-m. sha
19 篇 sanjoy baruah
19 篇 f. neri
19 篇 klaus i. pederse...
18 篇 k.g. shin
18 篇 james h. anderso...
17 篇 p. giaccone
17 篇 maode ma
17 篇 v.o.k. li
16 篇 jian-jia chen
16 篇 n.k. jha
16 篇 kwei-jay lin
16 篇 d. mosse
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant

语言

10,585 篇 英文
83 篇 其他
58 篇 中文

检索条件"主题词=Scheduling algorithm"

共 10726 条记录，以下是4831-4840 订阅

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

详细简洁

排序：

Optimal packet scheduling in tree-structured LEO satellite clusters

Optimal packet scheduling in tree-structured LEO satellite c...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： M.A. Bonuccelli F. Martelli S. Pelagatti Dipartimento di Informatica Università di Pisa Pisa Italy

来源：评论

学校读者我要写书评

暂无评论

Downlink scheduling with fairness and optimal antenna assignment for MIMO cellular systems

Downlink scheduling with fairness and optimal antenna assign...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Young-June Choi Jongtack Kim S. Bahk School of Electrical Engineering & Computer Science Seoul National University Seoul South Korea

A bandwidth-limited wireless channel can considerably improve its performance by exploiting multiple-input-multiple-output (MIMO) antennas. Combining spatial multiplexing with multiuser diversity, we develop an optimal cross-layer scheduling mechanism that executes fair scheduling at the upper layer and optimal antenna assignment at the physical layer. For fair scheduling, we propose a framework that achieves the objective of maximum capacity and proportional fairness. For optimal antenna assignment, we consider the Hungarian algorithm that maximally utilizes the characteristics of MIMO systems by adopting the graph theoretical approach. Through simulations, we demonstrate the performance of the optimal scheduling.

关键词： Downlink MIMO Optimal scheduling Diversity methods Processor scheduling Diversity reception Transmitting antennas scheduling algorithm Physical layer Receiving antennas

来源：评论

学校读者我要写书评

暂无评论

Application of MIMO and proportional fair scheduling to CDMA downlink packet data channels

Application of MIMO and proportional fair scheduling to CDMA...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： A. Pandey S. Emeott J. Pautler K. Rohani Motorola Research Laboratories Schaumburg IL USA Motorola Research Laboratories Fort Worth TX USA

There are many capacity enhancement techniques in wireless networks. Multiple-input-multiple-output (MIMO) antenna systems, channel-state based packet data scheduling algorithms and adaptive modulation and coding are examples of such techniques. In this paper, we provide the simulation results for various transmission schemes (including MIMO) in conjunction with a channel-state-based scheduling algorithm and an adaptive modulation and coding scheme Consequently, we demonstrate the cellular system capacity gain resulting from interaction between these three techniques. Specifically, system-level simulations are presented for the wideband CDMA (WCDMA) downlink shared channel.

关键词： MIMO Multiaccess communication Downlink Adaptive arrays Transmitting antennas Modulation coding scheduling algorithm Signal to noise ratio Wireless networks Wideband

来源：评论

学校读者我要写书评

暂无评论

scheduling stochastic tasks with parallelizable contents in multiprocessor systems

Scheduling stochastic tasks with parallelizable contents in ...

引用

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

作者： E.A. Maksoud R.A. Ammar Cairo University Egypt Computer Science and Engineering Department University of Connecticut USA

In this paper, we present a new heuristic algorithm to schedule a set of independent stochastic tasks with parallelizable contents in multiprocessor systems. Each task is described by its deadline and its time cost distribution, which is given in terms of mean and variance. A scheduled task may run as one unit on a single processor or partitioned into k parallel parts running on k different processors. The proposed algorithm exploits parallelism in tasks, if it is necessary, and distributes them among the available processors to yield a high probability of meeting their deadlines and, hence obtain better schedulability

关键词： Stochastic systems Multiprocessing systems Processor scheduling scheduling algorithm Costs Partitioning algorithms Real time systems Heuristic algorithms Parallel processing Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Rollout algorithms for stochastic scheduling problems

Rollout algorithms for stochastic scheduling problems

引用

IEEE Conference on Decision and Control

作者： D.P. Bertsekas D.A. Castanon Department of Elect. Engineering & Computer Sci M.I.T. Cambridge MA USA Department of Elect. & Computer Engineering Boston University Boston MA USA

Stochastic scheduling problems are difficult stochastic control problems with combinatorial decision spaces. We focus on a class of stochastic scheduling problems, the quiz problem and its variations. We discuss the use of heuristics for their solution, and we propose rollout algorithms based on these heuristics which approximate the stochastic dynamic programming algorithm. We show how the rollout algorithms can be implemented efficiently, with considerable savings in computation over optimal algorithms. We delineate circumstances under which the rollout algorithms are guaranteed to perform better than the heuristics on which they are based. We also show computational results which suggest that the performance of the rollout policies is near-optimal, and is substantially better than the performance of their underlying heuristics.

关键词： scheduling algorithm Stochastic processes Processor scheduling Heuristic algorithms Laboratories Vehicles Routing Traveling salesman problems

来源：评论

学校读者我要写书评

暂无评论

Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas

Power controlled minimum frame length scheduling in TDMA wir...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： A.K. Das R.J. Marks P. Arabshahi A. Gray Department of Electrical Engineering University of Washington Seattle WA USA School of Engineering and Computer Science Baylor University Waco TX USA Jet Propulsion Laboratory Pasadena CA USA

We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is to schedule them in a minimum number of time slots, so that each slot schedule is free of self-interferences and meets desired SINR constraints. Additionally, the transmit power vector corresponding to each slot schedule should be minimal. We consider two different versions of the problem, a per-slot version and a per-frame version, and develop mixed integer linear programming models which can be used for solving the problems optimally. In addition, we propose a heuristic algorithm for the per-slot version.

关键词： Intelligent networks Time division multiple access Wireless networks Power control Signal to noise ratio scheduling algorithm Mixed integer linear programming Heuristic algorithms Ad hoc networks Slot antennas

来源：评论

学校读者我要写书评

暂无评论

Fuzzy flow-shop scheduling models based on credibility measure

Fuzzy flow-shop scheduling models based on credibility measu...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Jin Peng Kaoping Song Department of Mathematical Sciences Tsinghua University Beijing China Department of Petroleum Engineering Daqing Petroleum Institute Daqing China

ISBN: (纸本)0780378105

The credibility measure of fuzzy events is a relatively new concept related to fuzzy variable. This paper aims at demonstrating how this concept can be used for managing fuzzy scheduling on flow-shop problems. Three types of fuzzy flow-shop scheduling models are presented. A hybrid intelligent algorithm is then designed to solve the proposed fuzzy flow-shop scheduling models. Computation experiments are provided to illustrate its effectiveness.

关键词： Processor scheduling scheduling algorithm Mathematical model Genetic algorithms algorithm design and analysis Stochastic processes Petroleum Fuzzy set theory Job shop scheduling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

An adaptive MPEG2-TS packet scheduling discipline for multimedia broadcasting

An adaptive MPEG2-TS packet scheduling discipline for multim...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： S. Teruhi K. Nidaira M. Nakayama H. Suda NTT Network Innovation Laboratories Yokosuka Kanagawa Japan

Digital broadcasting can now be used for the transmission of not only video data but also IP data for http and FTP services. ATM over MPEG2-TS protocol stack is examined as one of the technologies that allows MPEG2-TS to offer efficient and flexible multiplexing. We have already proposed a scheduling discipline that is simple enough to implement in hardware and adaptively generates MPEG2-TS packets from the incoming ATM cells. This paper shows the results of our evaluation (simulations) into its efficiency in terms of multiplexing gain, delay performance, and fairness. The proposed scheduling discipline is found to be superior to the alternatives with respect to the multiplexing gain while offering excellent delay and fairness characteristics.

关键词： scheduling algorithm Digital multimedia broadcasting Multimedia communication Asynchronous transfer mode Protocols Delay Satellite broadcasting Digital video broadcasting Round robin Broadcast technology

来源：评论

学校读者我要写书评

暂无评论

Performance of different scheduling strategies in a packet radio system

Performance of different scheduling strategies in a packet r...

引用

International Conference on Universal Personal Communications

作者： C. Johansson L. De Verdier F. Khan Ericsson Radio Systems AB Stockholm Sweden

The introduction of packet switched data in cellular systems requires new radio resource algorithms. For example, a scheduling algorithm is needed when more than one user may share the same physical channel, to determine the order in which users on the same channel should be allowed to transmit. This paper discusses the scheduling problem in general, and investigates the performance of three basic scheduling algorithms in an enhanced data rates for global GSM evolution/general packet radio service (EDGE/GPRS) system. Effort has been spent on modeling the bursty interference of a packet data network and using appropriate performance measures for the evaluation of such a network. The results indicate that the choice of scheduling discipline is very important, especially in a highly loaded system. With the performance measures used here, it is more important to consider the packet sizes than the users' different channel qualities.

关键词： Packet radio networks Telecommunication traffic World Wide Web scheduling algorithm Quality of service Interference Land mobile radio cellular systems GSM Ground penetrating radar Bit rate

来源：评论

学校读者我要写书评

暂无评论

Power-aware scheduling for Multiple Feasible Interval Jobs

Power-aware Scheduling for Multiple Feasible Interval Jobs

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

作者： Jian (Denny) Lin Albert M. K. Cheng Department of Computer Science University of Houston

ISBN: (纸本)9781424449316

Time-critical jobs in many real-time applications have more than one feasible interval. Such jobs can be executed in any of their feasible intervals. Given a Multiple Feasible Interval (MFI) job set that is schedulable, energy can be saved by carefully selecting the executing interval for each job. In this paper, we explore the energy minimization problem for real-time systems in which jobs have multiple feasible intervals. The static and dynamic energy management schemes are both investigated to minimize the energy consumption while preserving the system's feasibility. Focusing on the EDF scheduling algorithm, we first study reducing the dynamic power consumption. We show that the static optimal speed assignment problem is NP-Hard and propose a Simulated Annealing (SA) based approach to solve it. Then, we develop an on-line greedy algorithm to exploit the runtime slacks by "fetching" the eligible job from a hot spot to execute earlier, thus, reducing the dynamic energy consumption. In addition, a leakage-aware version is discussed to improve the overall energy efficiency as well. Simulation results show that all the proposed schemes can achieve significant improvements on energy efficiency while the system remains schedulable.

关键词： Real time systems Energy consumption Processor scheduling Energy efficiency Global Positioning System Navigation Application software scheduling algorithm Dynamic voltage scaling Voltage control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 480 481 482 483 484 485 486 487 488 489 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：