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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,033 篇 会议
683 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

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

日期分布

学科分类号

2,360 篇 工学
- 1,160 篇 计算机科学与技术...
- 851 篇 电气工程
- 664 篇 信息与通信工程
- 293 篇 软件工程
- 276 篇 电子科学与技术（可...
- 221 篇 控制科学与工程
- 200 篇 仪器科学与技术
- 150 篇 机械工程
- 58 篇 交通运输工程
- 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,730 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,645 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,303 篇 resource managem...
1,302 篇 real time system...
1,292 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
969 篇 job shop schedul...
945 篇 dynamic scheduli...
782 篇 costs
736 篇 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,590 篇 英文
82 篇 其他
58 篇 中文

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

共 10730 条记录，以下是4711-4720 订阅

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

详细简洁

排序：

Utility-Based scheduling with Non-Deterministic Fading Channels in Wireless Multi-Hop Networks

Utility-Based Scheduling with Non-Deterministic Fading Chann...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Zheng Liu Maode Ma Jufeng Dai School of Electronic Information Engineering Tianjin University TJU Tianjin China School of Electrical and Electronic Engineering Nanyang Technological University Singapore

In this paper, an innovative scheduling scheme is proposed for interference-limited wireless multi-hop networks with non-deterministic fading channels. The scheduling problem is considered as a network utility maximization(NUM) problem subject to link rate constraints. With jointly considering link scheduling and the statistical variations of both signal and interference power, the convex sets for NUM are built. The subgradient projection method based on dual decomposition is employed to solve the convex optimization problem. Then a practical algorithm is designed for the TDM mode wireless multihop networks with minimizing the discrepancy between the expected network cost and the optimal value in each timeslot. The numerical results demonstrate the convergence and the improvement over network utility made by our proposed scheme.

关键词： Fading Spread spectrum communication Interference Utility programs Signal to noise ratio Optimization methods algorithm design and analysis Time division multiplexing Dynamic scheduling scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast Channels

Scheduling jobs with hard deadlines over Multiple Access and...

引用

IEEE International Symposium on Information Theory

作者： Dinkar Vasudevan Vijay G. Subramanian Douglas J. Leith Hamilton Institute National University of Ireland Maynooth Ireland

We consider the problem of scheduling jobs with given start and finish times over two classes of multi-user channels, namely Multiple Access Channels and Degraded Broadcast Channels, and derive necessary and sufficien... 详细信息

关键词： Degradation Broadcasting Transmitters Sufficient conditions scheduling algorithm Multiuser channels Energy efficiency Gaussian channels

来源：评论

学校读者我要写书评

暂无评论

scheduling processing resources in programmable routers

Scheduling processing resources in programmable routers

引用

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

作者： P. Pappu T. Wolf Department of Computer Science Washington University Saint Louis MO USA

To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typically simple RISC multiprocessors that perform forwarding and custom application processing of packets. The inherent unpredictability of execution time of an arbitrary instruction code poses a significant challenge in providing QoS guarantees for data flows that compete for such processing resources in the network. However, we show that network processing workloads are highly regular and predictable. Using estimates of execution times of various applications on packets of given lengths, we provide a method for admission control and QoS scheduling of processing resources. We present a processor scheduling algorithm called estimation-based fair queuing (EFQ) which uses these estimates, and provides significantly better delay guarantees than processor scheduling algorithms which do not take packet execution times into consideration.

关键词： Processor scheduling scheduling algorithm Bandwidth Search engines Quality of service Delay estimation Protocols Admission control Internet Switches

来源：评论

学校读者我要写书评

暂无评论

Analysis of reduced rate scheduling for switches with reconfiguration overhead

Analysis of reduced rate scheduling for switches with reconf...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Xin Li M. Hamdi Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China

Hybrid switch architecture with electronic buffering/processing and optical switching fabric is receiving a lot of attention as potential candidate for the design of high-performance and scalable switches/routers. However, the reconfiguration overhead of optical fabrics brings new challenges to system and scheduling algorithm design. For example, speedup is compulsory to make the switch stable; the scheduling rate has to be reduced compare to the traditional slot-by-slot scheduling in electronic switch. This paper provides instructions on how to choose speedup, scheduling algorithm and holding time. Main results include: 1) a speedup of 2 ensures switch stability and is cost-effective; 2) effect of reconfiguration delay is exaggerated at high traffic load and it is worth using complex scheduling algorithm; and 3) AVERAGE holding method performs better under most traffic scenarios.

关键词： Optical switches Optical buffering Fabrics scheduling algorithm Optical fibers Optical design Wavelength division multiplexing Optical fiber devices Coaxial cables Optical fiber cables

来源：评论

学校读者我要写书评

暂无评论

Stochastic Primal-Dual scheduling Subject to Rate Constraints

Stochastic Primal-Dual Scheduling Subject to Rate Constraint...

引用

IEEE Conference on Wireless Communications and Networking

作者： Xin Wang Georgios B. Giannakis Department of ECE University of Minnesota Minneapolis MN USA

In this paper we derive a stochastic primal-dual (SPD) algorithm for downlink/uplink scheduling of multiple connections with rate requirements, where each connection transmits using adaptive modulation and coding over a wireless fading channel. Based on quantized channel state information at the transmitters, we derive the information-theoretic optimal downlink and uplink resource allocation/scheduling strategies. When the fading statistics are not known a priori, we develop an SPD algorithm which can dynamically adapt the scheduling policy online. We established analytically and confirm by simulations that with affordable complexity, this SPD algorithm asymptotically converges to the optimal scheduling strategies from any initial value.

关键词： Stochastic processes Optimal scheduling scheduling algorithm Downlink Fading Modulation coding Channel state information Transmitters Resource management Statistics

来源：评论

学校读者我要写书评

暂无评论

scheduling study in HSDPA system

Scheduling study in HSDPA system

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： M. Assaad D. Zeghlache Institut National des Telecommunications Evry France

This paper focuses on the study of scheduling techniques in HSDPA system. In this context, we propose to use the score based (SB) scheduling algorithm in HSDPA. This algorithm is compared to another scheduling algorithm, called proportional fair (PF), widely used and studied in the literature. To make this comparison, an analytical model allowing to evaluate the cell capacity and the user bit rate is proposed. The radio channel is assumed to he a dense multipath frequency selective channel with uncorrelated signal envelope following a Rayleigh distribution and wide-sense stationary uncorrelated scattering (WSSUS). Results show that SB seems to be a better trade-off between "fairness" and "efficiency" than PF

关键词： Multiaccess communication scheduling algorithm Downlink Analytical models Bit rate Automatic repeat request Interference Rayleigh scattering Modulation coding Fading

来源：评论

学校读者我要写书评

暂无评论

Task scheduling for Heterogeneous Computing Based on Learning Classifier System

Task Scheduling for Heterogeneous Computing Based on Learnin...

引用

International Conference on Artificial Intelligence and Computational Intelligence (AICI)

作者： Jiadong Yang Hua Xu Peifa Jia State Key Laboratory Intelligent Technology and Systems Tsinghua National Laboratory of Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China

Task scheduling still remains one of the most challenging problems to achieve high performance in heterogeneous computing environments in spite of numerous efforts. This paper presents a novel scheduling algorithm based on learning classifier system for heterogeneous computing environment. In the presented algorithm, XCS classifier system is used to find the optimal task assignment on different processors, and the execution sequence of tasks on the same processor is set by the heuristic used in list scheduling approach. Empirical studies on benchmark task graphs show that the proposed algorithm is able to produce higher speedup compared with the related algorithms. Further experiments also indicate that the proposed algorithm maintains almost the same performance with different parameter settings.

关键词： Processor scheduling scheduling algorithm High performance computing Learning Clustering algorithms Artificial intelligence Computational intelligence Intelligent systems Computational and artificial intelligence Competitive intelligence

来源：评论

学校读者我要写书评

暂无评论

On recent advances in time/utility function real-time scheduling and resource management

On recent advances in time/utility function real-time schedu...

引用

International Symposium on Object-Oriented Real-Time Distributed Computing

作者： B. Ravindran E.D. Jensen P. Li ECE Department Virginia Polytechnic Institute and State University Blacksburg VA USA MITRE Corporation Bedford MA USA Microsoft Corporation Redmond WA USA

We argue that the key underpinning of the current state-of-the real-time practice - the priority artifact - and that of the current state-of-the real-time art - deadline-based timeliness optimality - are entirely inadequate for specifying timeliness objectives, for reasoning about timeliness behavior, and for performing resource management that can dependably satisfy timeliness objectives in many dynamic real-time systems. We argue that time/utility functions and the utility accrual scheduling paradigm provide a more generalized, adaptive, and flexible approach. Recent research in the utility accrual paradigm has significantly advanced the state-of-the-art of that paradigm. We survey these advances.

关键词： Resource management Time factors Real time systems Phased arrays scheduling algorithm Art Embedded system Orbital robotics NASA Propulsion

来源：评论

学校读者我要写书评

暂无评论

Analytical model of the radio interface in the UMTS with packet scheduling mechanism

Analytical model of the radio interface in the UMTS with pac...

引用

AFRICON Conference

作者： Maciej Stasiak Janusz Wiewiora Poznan University of Technology Poznan Poland

The paper presents the application of a new analytical model of the full-availability group carrying a mixture of different multi-rate traffic classes with compression property for modeling the WCDMA radio interface with packet scheduling. The proposed model can be directly used for modeling of the WCDMA interface in the UMTS network servicing different traffic classes with and without compression. The described model can be applied for a validation of the efficiency of the WCDMA interface measured by the blocking probability and the average carried traffic for particular traffic classes.

关键词： Analytical models 3G mobile communication scheduling algorithm Telecommunication traffic Traffic control Multiaccess communication Bandwidth algorithm design and analysis Capacity planning Communications technology

来源：评论

学校读者我要写书评

暂无评论

Arm scheduling in shadowed disks

Arm scheduling in shadowed disks

引用

IEEE Compcon

作者： D. Bitton Department of Electrical Engineering and Computer Science University of Illinois Chicago Chicago IL USA

The author describes a number of configurations and disk scheduling algorithms for shadow sets, and presents an analysis of seek time based on both a simulation and an analytic model. She focuses on the algorithm based on assigning a read request to the arm that is within the shortest seek distance of the target location. With this scheduling algorithm, shadowing five disks decreases the expected seek time for reads by 50%. For a ratio of reads to writes equal to 1.5 or higher, shadowing decreases the overall seek time by 20%.< >

关键词： Shadow mapping Availability scheduling algorithm algorithm design and analysis Disk drives Analytical models Arm Processor scheduling Maintenance Control systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 468 469 470 471 472 473 474 475 476 477 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：