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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

scheduling algorithm of Great Tolerance Wireless Communication Delay for Wireless Network Control System

Scheduling Algorithm of Great Tolerance Wireless Communicati...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Jun Wang Wei Gao Shenyang Institute of Chemical Technology Liaoning China

A majority of existing scheduling models of network control system are designed without considering the characteristic of wireless technology. They face serious degradations in wireless industrial applications. This paper proposed scheduling algorithm of great tolerance wireless communication delay (GTD). This algorithm resolves real-time problem of cycle communication task in wireless network control system (WNCS), and eases overtime phenomenon of cycle communication task caused by wireless network delay partly. Finally, we evaluate the performance of the proposed GTD for the WNCS. Simulation results show that it is more effective than traditional scheduling algorithms in the WNCS applications.

关键词： scheduling algorithm Wireless communication Disruption tolerant networking Wireless networks Communication system control Control systems Job shop scheduling Control system synthesis Degradation Electrical equipment industry

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for partially parallel architecture of LDPC decoder by matrix permutation

Scheduling algorithm for partially parallel architecture of ...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： In-Cheol Park Se-Hyeon Kang Department of Electrical Engineering and Computer Science KAIST Daejeon South Korea

ISBN: (纸本)0780388348

The fully parallel LDPC decoding architecture can achieve high decoding throughput, but it suffers from large hardware complexity caused by a large set of processing units (PUs) and complex interconnections. A practical solution of area-efficient decoders is to use the partially parallel architecture in which a PU is shared for several rows or columns. It is important in the partially parallel architecture to determine the rows or columns to be processed in a PU and their processing order. The dependencies between rows and columns should be considered to minimize the overall processing time by overlapping the decoding operations. This paper proposes an efficient scheduling algorithm that can be applied to general LDPC codes, which is based on the concept of matrix permutation. Experimental results show that the proposed scheduling achieves a higher decoding rate, leading to a reduction of 25% processing time on average. A 1024-bit rate-1/2 LDPC decoder, employing the proposed scheduling algorithm, provides almost 1 Gbps decoding throughput and occupies one-fifth the area compared to the fully parallel decoder.

关键词： scheduling algorithm Parallel architectures Parity check codes Computer architecture Throughput Hardware Sparse matrices Message passing Iterative decoding Error probability

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for UTRA TDD mode

Scheduling algorithm for UTRA TDD mode

引用

IEEE/AFCEA EUROCOMM Information Systems for Enhanced Public Safety and Security

作者： G. Ostermayer P. Slanina C. Holzl C. Mecklenbrauker F. Raji T. Stadler PSE TN MNR Siemens AG Vienna Austria

A method of assigning resources to different non-real time (NRT) bearers within a cell of UMTS Terrestrial Radio Access/Time Division Duplex (UTRA/TDD) system is discussed. A very important measure of the quality of such a scheduling algorithm is the ratio of satisfied users at a certain system load. Different criteria for a satisfied user requires different scheduling methods. We propose an adaptive algorithm that can deal with different satisfied user criteria by simply adjusting a single parameter. Simulations have been performed for downlink traffic for various data rates. The available results include ratio of satisfied users, data throughput and block delay. Considering these results we can conclude that the proposed algorithm works quite well due to the possibility of optimizing different output parameters (ratio of satisfied users, data throughput, block delay) by adjusting a single scheduling parameter.

关键词： scheduling algorithm Web pages Downlink Throughput Delay Resource management Frequency Real time systems 3G mobile communication Adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm Based on Force Directed Clustering

Scheduling Algorithm Based on Force Directed Clustering

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Alistair Palmer Oliver Sinnen Department of Electrical and Computer Engineering University of Auckland New Zealand

This paper describes a new task scheduling algorithm based on clustering. In this new approach, clustering of the tasks is achieved by applying a force model to the task graph. From an initial configuration of the task graph, forces act upon the nodes to manoeuvre them into a low energy or equilibrium state. Clusters are created from the equilibrium state and scheduled for an unlimited number of processors. This algorithm is compared in an extensive experimental evaluation to three other clustering algorithms namely, linear, single edge and dominant sequence clustering. By keeping the mapping and scheduling phases of the algorithms identical, we compare only the difference in clustering between all algorithms. Results show that force directed clustering is very promising, especially for a limited number of processors.

关键词： scheduling algorithm Clustering algorithms Processor scheduling Springs Distributed computing Energy states Heuristic algorithms Cost function Application software Visualization

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for On-Demand Bus System

Scheduling Algorithm for On-Demand Bus System

引用

International Conference on Information Technology: New Generations (ITNG)

作者： Kota Tsubouchi Kazuo Hiekata Hiroyuki Yamato Graduate School of Frontier Sciences University of Tokyo Kashiwa Chiba Japan Graduate School of Engineering University of Tokyo Kashiwa Chiba Japan

ISBN: (纸本)9781424437702

On-Demand Bus is a Demand Responsive Transit (DRT) service that passengers will be transported by the vehicles after they reserve a seat. The vehicle wonpsilat move if there is no reservation and the efficiency is expected as a new transportation service. It allows potential passengers to request service via the Internet or mobile phone, with requests for ride being processed by a server computer. The requests compose of pick-up location, delivery location and desired delivery time (or pick-up time). The computer executes two main algorithms which are vehicle-choosing algorithm and routing algorithm. Using the vehicle-choosing algorithm was used for decision about which vehicle will accept the new request. And the routing algorithm was used to design the new route and schedule for the vehicle chosen to serve the new request. After calculation, the system will report to the customer whether the request is accepted or not. If it is accepted, the vehicle will pick up and deliver him to his destination within a guaranteed time - not later than the desired delivery time (or not earlier than pick-up time). We also carried out an experiment to evaluate the developed algorithm worked as we designed.

关键词： scheduling algorithm Vehicles Routing Road transportation Costs Mobile handsets algorithm design and analysis Senior citizens Information technology Automotive engineering

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for programmable logic controllers with remote I/Os

Scheduling algorithm for programmable logic controllers with...

引用

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

作者： Seungkweon Jeong Young Shin Kim Wook Hyun Kwon Control Information Systems Laboratory School of Electrical Engineering Seoul National University Seoul South Korea

ISBN: (纸本)0818680733

In this paper, a scheduling algorithm is proposed for a programmable logic controller (PLC) with remote I/Os, assuming the multi-tasking facilities. Since sequence programs are executed on the application processor and I/O data are transmitted by the network processor concurrently, the proposed algorithm schedules the data transmission as well as the sequence program execution. The suggested algorithm guarantees the bounded response time, which is one third of the worst case response time in the absence of scheduling. Computer simulation shows that the algorithm can be easily applied to a real PLC without critical constraints on utilization of resources and inter-relation among tasks.

关键词： scheduling algorithm Programmable logic arrays Programmable logic devices Programmable control Large-scale systems Control systems Data communication Delay Manufacturing automation Computer architecture

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm for real-time burst traffic using dynamic weighted round robin

Scheduling algorithm for real-time burst traffic using dynam...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Taeck-Geun Kwon Sook-Hyang Lee June-Kyung Rho Research & Development Laboratory LG Information and Communication Limited Kyunggi South Korea

In this paper, we propose a new scheduling algorithm, called the dynamic weighted round robin (DWRR) scheduling discipline, which is suitable for real-time variable bit rate (rtVBR) service as well as other services such as constant bit rate (CBR), non real-time VBR (nrtVBR), available bit rate (ABR) services in a high-speed network. We employ dynamic weight to serve a queue associated with active and busy connection with strict delay and bandwidth requirements. This adaptive scheduling algorithm enables a network to provide multimedia service characterized by integrated and burst traffic. We finally compare our new algorithm with existing one in terms of fairness and Quality of Service (QoS) guarantee by simulation study.

关键词： scheduling algorithm Bit rate Traffic control Quality of service Round robin Dynamic scheduling High-speed networks Delay Bandwidth Adaptive scheduling

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm in data path synthesis using the Tabu search technique

Scheduling algorithm in data path synthesis using the Tabu s...

引用

European Conference on Design Automation

作者： S. Amellal B. Kaminska Electrical Engineering Department Ecole Polytechnique de Montrèal QUE Canada

A model in integer linear programming (ILP) for the scheduling problem in the high-level synthesis of digital systems at register transfer level is developed using a new approach based on penalty weights. This approach avoids the inflexibility of the ILP formulations developed in related works where the functional unit performing each type of operation is fixed before scheduling. The Tabu search method was adapted for this purpose. The mathematical formulation developed takes into account almost all the area parameters and allows an unrestricted search in a large space delimited only by the components available in the library used.< >

关键词： scheduling algorithm Hardware Cost function High level synthesis Optimization methods Libraries Integrated circuit interconnections Digital systems Integer linear programming Search methods

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm of Load Balancing Based on Dynamic Policies

Scheduling Algorithm of Load Balancing Based on Dynamic Poli...

引用

International Conference on Networking and Services (ICNS)

作者： Jie Chang Wen'an Zhou Junde Song Zhiqi Lin Beijing University of Posts and Telecommunications China

ISBN: (纸本)9781424459278

Load balancing is a method to strengthen the network data processing capability, increase the flexibility and availability of the network. Using multiple components with load balancing, instead of a single component, to provide external services can solve the problem of insufficient processing capacity of a single host, and can also solve the challenges posed by concurrent access. Because of the importance of load balancing scheduling, which is the key issue, this article will propose a scheduling algorithm based on dynamic policy. This algorithm retains the advantages of the current widely used polling scheduling, on the other hand, it avoids some shortages of the polling scheduling algorithm by using dynamic policy framework.

关键词： scheduling algorithm Load management Availability Dynamic scheduling Costs Application software Single machine scheduling Data processing Telecommunication traffic Computer networks

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithm in a point-to-multipoint broadband wireless access network

Scheduling algorithm in a point-to-multipoint broadband wire...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： W.K. Wong H. Tang Shanzeng Guo V.C.M. Leung Communications Rcscarch Centre Ottawa ONT Canada Department of System Computer Engineering Carleton University Ottawa ONT Canada Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

Point-to-multipoint broadband wireless access (BWA) is an attractive solution to provide advanced data services to users who do not have easy access to wireline data services. However, BWA will need to support delay sensitive services as users and applications are becoming increasingly sophisticated. Wireless packet scheduling is an important part of quality-of-service (QoS) provisioning in BWA. The biggest difficulty in wireless packet scheduling is the location-dependent channel errors. Channel condition independent fair scheme (CIF) (T.S. Eugene, et al., March 1998) uses explicit leading/lagging approach to compensate for the erroneous channel state, but is not able to satisfy both rapid convergent guaranteed throughput and fairness. In this paper, we propose to use the token bank fair queuing (TBFQ) scheduling algorithm as a QoS provisioning mechanism for an asymmetric broadband point-to-multipoint wireless LAN. We consider the throughput and fairness performance of TBFQ under location-dependent channel error condition with variable packet length. This work is an extension of our previous work in applying TBFQ in next generation cellular networks.

关键词： scheduling algorithm Intelligent networks Wireless networks Wireless sensor networks Delay Wireless LAN Throughput Web and internet services Mobile communication Sociotechnical systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：