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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4911-4920 订阅

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

详细简洁

排序：

Advanced packet scheduling in soft frequency reuse scenarios for multiantenna packet radio systems

Advanced packet scheduling in soft frequency reuse scenarios...

引用

Future Network and Mobile Summit

作者： Stanislav Nonchev Mikko Valkama Department of Communications Engineering Tampere University of Technology Tampere Finland

The radio resource management functionality plays an important role in new OFDMA based networks. The control of the network resource division among the users is performed by packet scheduling functionality based on maximizing cell coverage and capacity while satisfying certain quality of service constrains. In order to mitigate inter-cell and co-channel interference problems in OFDMA cellular networks, soft frequency reuse with different power mask patterns is used. Stemming from our previous studies in scheduling algorithm developments, we extend the usability of packet scheduling techniques with built in transmit power considerations in the overall priority metrics calculations and scheduling decisions. In this paper, we investigate the system performance of combined soft frequency reuse schemes with advanced power-aware packet scheduling algorithms for further optimization between user fairness and cell throughput. As a concrete example, we demonstrate that by using such technique significant coverage improvements in the order of 30% can be obtained at the expense of only 14% throughput loss. Furthermore, the user fairness is also greatly increased, by more than 18%, when measured using Jain's fairness index.

关键词： scheduling algorithm Throughput OFDM scheduling Measurement MIMO Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Distributed Minimal Time Convergecast scheduling in Wireless Sensor Networks

Distributed Minimal Time Convergecast Scheduling in Wireless...

引用

International Conference on Distributed Computing Systems

作者： S. Gandham Ying Zhang Qingfeng Huang Department of Computer Science University of Texas Dallas USA Computer Science Laboratory Palo Alto Research Center Inc.orporated USA

We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm referred to as convergecast. We are interested in determining a TDMA schedule that minimizes the total time required to complete the convergecast. We consider a simple version of the problem wherein every node generates exactly one packet. We propose a distributed convergecast scheduling algorithm that requires at most 3N timeslots, where N represents the number of nodes in the network. Through extensive simulations, we demonstrate that actual number of timeslots needed is around 1.5N. In addition to time efficiency, we prove that our convergecast scheduling algorithm requires the nodes to buffer no more than two packets at any instance. We propose a sleep schedule that conserves more than 50% of the energy. We present simulation results for a real application scenario to show that our convergecast scheduling algorithm performs significantly better than existing convergecast algorithms.

关键词： Intelligent networks Wireless sensor networks Time division multiple access scheduling algorithm Delay Base stations Processor scheduling Computer science Sleep Media Access Protocol

来源：评论

学校读者我要写书评

暂无评论

High multiplicity scheduling of file transfers with divisible sizes on multiple classes of paths

High multiplicity scheduling of file transfers with divisibl...

引用

IEEE International Symposium on Consumer Electronics (ISCE)

作者： Mugurel Ionut Andreica Nicolae Tapus Computer Science Department Polytechnic University of Bucharest Bucharest Romania

Distributed applications and services requiring the transfer of large amounts of data have been developed and deployed world wide. The best effort model of the Internet cannot provide these applications with the so much needed quality of service guarantees, making necessary the development of file transfer scheduling techniques, which optimize the usage of network resources. In this paper we consider the high multiplicity scheduling of file transfers over multiple classes of paths with the objective of minimizing the makespan, when the files have divisible sizes. We also consider another objective, that of maximizing the total profit, in the context of some special types of mutual exclusion constraints (tree and clique constraint graphs).

关键词： Optimal scheduling scheduling algorithm Tree graphs Application software Quality of service Polynomials Minimization methods Testing Processor scheduling Computer science

来源：评论

学校读者我要写书评

暂无评论

Partial global flexible scheduling for coordinating resource-bounded agents

Partial global flexible scheduling for coordinating resource...

引用

International Conference on Multi Agent Systems

作者： A.-I. Mouaddib CRIL and IUT Lens Lens France

We have presented the partial global flexible scheduling approach that proposes using distributed artificial intelligence methods combined with scheduling techniques to the control of progressive reasoning units which are distributed, self-interested, want to maximize their own performance and there is no central controller available.

关键词： Lenses Centralized control Postal services Real time systems Time factors Control systems Airports Sorting Level set scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling for conditional resource sharing

Optimal scheduling for conditional resource sharing

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： A. Yamada S. Nakamura N. Ishiura I. Shirakawa T. Kambe Sharp Corporation Tenri Nara Japan Department Information Systems Engineering Osaka University Suita Osaka Japan Sharp Corporation Nara Japan

A new approach is described for the datapath scheduling of behavioral descriptions containing nested conditional branches of arbitrary structures. This paper formulates a time-constrained scheduling problem as a 0-1 integer programming problem, in which each constraint is expressed in the form of a Boolean function, and a satisfiability problem is defined by the product of the Boolean functions. A procedure is then described, which intends to seek an optimal solution by means of a branch-and-bound method on a binary decision diagram representing the satisfiability problem. Experimental results show that our approach attains better solutions than other existing methods.

关键词： Optimal scheduling Resource management Boolean functions Data structures Cost function Information systems Linear programming Testing scheduling algorithm Optimal control

来源：评论

学校读者我要写书评

暂无评论

Fair, Class Based Packet scheduling Scheme Considering Handoff Priority to Improve QoS for Broadband Wireless Access Systems

Fair, Class Based Packet Scheduling Scheme Considering Hando...

引用

International Conference on Computer Engineering and Applications (ICCEA)

作者： Hussain Mohammed Mark Gregory RMIT University Melbourne VIC AU School of Electrical and Computer Engineering RMIT University Melbourne Australia

The success of emerging Broadband Wireless Access Systems (BWAs) depend on their ability to utilize the network resources in an efficient way. It's a complex task due to heterogeneous service nature and diverse Quality of Service (QoS) requirements of different applications that these systems support. Packet scheduling is one of the key components to provide QoS that plays a vital role in BWAs. This paper proposes a scheduling mechanism for providing QoS in mobile networks, which exploit IP as a transport technology for transferring data between base stations of Broadband Wireless Access Systems at the radio layer. In order to improve QoS a new scheduling algorithm is performed at both IP and radio layer, which exploit handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The fairness among the users of different classes is also accounted. Performance results obtained by computer simulation show that, by exploiting the new scheduling algorithm, the system is able to provide low handoff packet dropping rate, low packet forwarding rate, low packet delay and ensures fairness among different services.

关键词： scheduling algorithm Quality of service Delay Throughput Downlink Computer networks Application software Processor scheduling Computer applications Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant real-time task scheduling in the MAFT distributed system

Fault-tolerant real-time task scheduling in the MAFT distrib...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： R.M. Kieckhafer Department of Computer Science and Engineering University of Nebraska Lincoln Lincolnshire NE USA

The development of the task scheduling mechanism for the multicomputer architecture for fault-tolerance (MAFT) is discussed. MAFT is a distributed computer system designed to provide high performance and extreme reliability in real-time control applications. The impact of the system's functional requirements, fault-tolerance requirements, and architecture on the development of the scheduling mechanism is examined. MAFT uses a priority-list scheduling algorithm modified to provide extreme reliability in the monitoring of tasks and the detection of scheduling errors. It considers such issues as modular redundancy, Byzantine agreement, and the use of multiversion software and dissimilar hardware. An example of scheduler performance with a realistic workload is presented.< >

关键词： Fault tolerance Processor scheduling Computer architecture Distributed computing High performance computing Real time systems Control systems Application software Fault tolerant systems scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

On the performance of Multi-Radio ARQ and Packet scheduling in Ambient Networks

On the performance of Multi-Radio ARQ and Packet Scheduling ...

引用

IEEE Vehicular Technology Conference

作者： Georgios P. Koudouridis Peter Karlsson Corore RD TeiSoner Sweden

In alignment to an "always best experience" scenario, we assess gains on user traffic in the context of a multi-radio access environment where heterogeneous radio technologies are integrated at link layer and users are jointly scheduled across multiple radio accesses (RAs). Such integration allows for an implementation of multi-radio transmission diversity (MRTD) which switches transmission of a user's data over the available RAs. The RA selection is based on measurements of radio link quality as reported by the radio interface. The application of an ARQ scheme utilising multiple RAs (MR-ARQ) in conjunction with MRTD provides added gains on user delay and neutralizes parts of degradations in spectral efficiency caused by reporting delays. Such multi-radio ARQ mechanism exploits the diversity across independent RAs, and results in gains in throughput over those achieved by RA-specific ARQ. MRTD when combined with MR-ARQ shows gains of up to 35% in spectral efficiency compared to the case where the radio accesses operate independently.

关键词： Automatic repeat request scheduling algorithm Ambient networks Delay Research and development Performance gain Degradation Wireless communication Rats Traffic control

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithms for I/O scheduling for efficient retrieval of large objects from tertiary storage

Heuristic algorithms for I/O scheduling for efficient retrie...

引用

Australasian Database Conference (ADC)

作者： ChanHo Moon Hyunchul Kang Department of Computer Science and Engineering Chung-Ang University Seoul South Korea

ISBN: (纸本)0769509665

Multimedia data service applications of today are to efficiently deal with a possibly massive amount of large objects (LOBs). The storage capacity of the traditional disk-based DBMS is certainly limited to support such applications. As such, it is necessary for the DBMS to employ tertiary storage devices, which perform often with long latency and yet can provide a huge amount of storage capacity at relatively low cost. We investigate tertiary I/O scheduling algorithms for efficient retrieval of LOBs that are stored in the tertiary storage device with multiple platters. Taking into consideration the performance characteristics of the tertiary storage devices and LOB retrieval, we propose a set of tertiary I/O scheduling algorithms, each of which employs a different heuristic for scheduling, reducing the latency involved in tertiary I/O for retrieving LOBs. The performance of the proposed algorithms is evaluated through detailed simulation experiments.

关键词： Heuristic algorithms scheduling algorithm Delay Biomedical optical imaging Libraries Application software Costs Drives Processor scheduling Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Incorporating retransmission diversity in quality-of-service guaranteed multi-user scheduling

Incorporating retransmission diversity in quality-of-service...

引用

Annual Conference on Information Sciences and Systems (CISS)

作者： Xin Wang Di Wang Irena Li Hanqi Zhuang Salvatore D. Morgera Department of Electrical Engineering Florida Atlantic University Boca Raton FL USA

A cross-layer optimization combining retransmission diversity with multi-user diversity is investigated for wireless communications. To this end, a joint design of adaptive modulation and coding with retransmission-based automatic repeat request protocol is first outlined. This design is then employed to devise multi-user scheduling schemes which can optimally capture the available multiuser and retransmission diversities. In addition, the proposed on-line scheduling algorithms can operate even when the underlying fading channel distribution is unknown a priori, while asymptotically converging to the offline benchmark with guarantees on prescribed fairness and rate requirements. Numerical results are provided to verify the merits of our novel schemes for multi-user transmissions over Nakagami block fading channels.

关键词： Quality of service Diversity reception Automatic repeat request Fading Modulation coding scheduling algorithm Cross layer design Media Access Protocol Physical layer Government

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 488 489 490 491 492 493 494 495 496 497 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：