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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Wrist collision avoidance of two robots: A collision map and time scheduling approach

Wrist collision avoidance of two robots: A collision map and...

引用

IEEE Conference on Decision and Control

作者： B. H. Lee School of Electrical Engineering Purdue University West Lafayette IN USA

This research presents an approach to collision-free motion planning of two moving robots in a common workspace. Due to the distinct nature of the potential collisions between the two moving robots, a new classification of collision situations is presented and utilized for planning a collision-free path. Notions of a collision map and time scheduling are developed and applied for realizing a collision-free motion planning. An example is shown for the time scheduling of the trajectory, which shows the significance of the proposed approach in collision-free motion planning of the two moving robots.

关键词： Wrist Collision avoidance Robots Motion planning Path planning Trajectory Delay Terminology scheduling algorithm Servomechanisms

来源：评论

学校读者我要写书评

暂无评论

Priority-driven scheduling and bandwidth allocation for MPEG-2 decoding

Priority-driven scheduling and bandwidth allocation for MPEG...

引用

EUROMICRO Conference

作者： Jinhwan Kim Bonggyou Lee Yong Ho Song Hansung University South Korea Hanyang University South Korea

We propose an efficient algorithm to schedule real-time multimedia tasks for streaming MPEG-2 video clips. In our task model, each frame is decoded by a separate multimedia task whose priority is decided based on the precedence and importance of the corresponding frame in the video stream. We develop a priority-driven scheduling policy in order to effectively allocate the CPU bandwidth to multimedia tasks for MPEG-2 decoding. We show how to dynamically control the fraction of the allocated bandwidth according to the priority. The goal of the proposed scheduling method is to minimize the number of decoding tasks that have missed their deadlines while reducing the decoding times of these multimedia tasks. The performance of this scheduling method is compared against that of a similar technique with no priority scheme through simulation experiments.

关键词： Channel allocation Decoding Streaming media Transform coding Video compression Processor scheduling scheduling algorithm Bandwidth Multimedia systems Videoconference

来源：评论

学校读者我要写书评

暂无评论

Efficient user scheduling under Low Rate Feedback for Correlated MIMO Broadcast Channels

Efficient user Scheduling under Low Rate Feedback for Correl...

引用

IEEE International Conference on Communications (ICC)

作者： W. Xu C. Zhao Z. Ding National Mobile Communications Research Laboratory South-East University Nanjing Jiangsu China Department of Electrical and Computer Engineering University of California슠Davis CA USA

This paper investigates the scheduling of user signals in MIMO systems with spatially correlated channels. By maximizing an upper bound of the sum capacity, we propose a scheduling scheme which requires only a single scalar feedback from each receiving user. To further reduce the need for user information feedback and better explore the spatial correlation information, a more efficient scheduling method is also developed. This new approach only requires a 1-bit indicator from each user and selects users according to the slowly varying MIMO channel correlation information. Numerical results verify the effectiveness of our proposed schemes.

关键词： Feedback MIMO Broadcasting Processor scheduling Upper bound Multiaccess communication Diversity methods scheduling algorithm Communications Society Mobile communication

来源：评论

学校读者我要写书评

暂无评论

scheduling of track updates in phased array radars

Scheduling of track updates in phased array radars

引用

IEEE National Conference on Radar

作者： D. Stromberg National Defense Research Establishment Linkoping Sweden

This paper presents an efficient algorithm for scheduling of search and update tasks in phased array radar. It is based on temporal reasoning with roots in the theory of knowledge-based temporal logic. The measurement of each task is scheduled according to a number of spatial and temporal constraints, all of which are transferred to the temporal domain. Though the algorithm does not necessarily compute the optimal time assignment to tasks, it has some very good characteristics. It has low computational complexity and load requirements. It offers flexibility in choosing final update time and it can be adapted to situational requirements. It computes update time exactly once for every measurement, and it has excellent computational properties compared to more general scheduling approaches. A radar system with this scheduling facility is registered by the Swedish Patent Office.

关键词： Radar tracking Phased arrays Time measurement Processor scheduling Target tracking scheduling algorithm Dynamic programming Radar measurements Pulse measurements Logic

来源：评论

学校读者我要写书评

暂无评论

Rail network routing and scheduling using simulated annealing

Rail network routing and scheduling using simulated annealin...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： D.E. Brown C.L. Huntley B.P. Markowicz D.E. Sappington The Institute for Parallel Computation School of Engineering and Applied Science University of Virginia Charlottesville VA USA CSX Transportation Jacksonville FL USA

The authors present both simulated annealing and genetic algorithm approaches to routing and scheduling traffic over a freight rail network. They provide a brief overview to the rail routing and scheduling problem that formed the basis for the case study. Both algorithms were tested. These two approaches are contrasted and the conclusion is that for this application, simulated annealing is superior.< >

关键词： Rails Routing Simulated annealing Genetic algorithms Computational modeling scheduling algorithm Encoding Cities and towns Processor scheduling Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF scheduling on a Uniprocessor

Worst Case Response Time Analysis of Sporadic Graph Tasks wi...

引用

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

作者： Hui Xue Zhao L. George S. Midonnet ESIGETEL Avon France ECE LACSC Paris France IGM Université de Marne la Vallée Marne-la-Vallee France

This paper considers the problem of preemptive hard real-time scheduling of sporadic graph tasks on a uniprocessor with earliest deadline first (EDF). A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response time of any subtask of a graph task. We investigate the late deadline constraint

关键词： Computer aided software engineering Delay Processor scheduling scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Static-priority scheduling on multiprocessors

Static-priority scheduling on multiprocessors

引用

Real-Time Systems Symposium (RTSS)

作者： B. Andersson S. Baruah J. Jonsson Department of Computer Engineering Chalmers University of Technology Goteborg Sweden Department of Computer Science North Carolina State University Chapel Hill NC USA

ISBN: (纸本)0769514200

The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A scheduling algorithm is proposed for static-priority scheduling of such systems; this algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm. It is proven that this algorithm successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocessor platform. It is also shown that no static-priority multiprocessor scheduling algorithm (partitioned or global) can guarantee schedulability for a periodic task set with a utilization higher than one half the capacity of the multiprocessor platform.

关键词： Processor scheduling scheduling algorithm Optimal scheduling Real time systems Runtime Partitioning algorithms System testing Context modeling Research initiatives Subspace constraints

来源：评论

学校读者我要写书评

暂无评论

Integrated Fractional Load and Packet scheduling for OFDMA Systems

Integrated Fractional Load and Packet Scheduling for OFDMA S...

引用

IEEE International Conference on Communications Workshops, ICC

作者： G. Monghal S. Kumar K. I. Pedersen P. E. Mogensen University of Aalborg Aalborg Denmark Nokia Siemens Networks Aalborg Denmark Nokia Siemens Networks University of Aalborg Aalborg Denmark

This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic. This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality indicator (CQI) reports from the user equipments. Fractional load handling is operated without inter eNode-B coordination. We conclude that the system can operate under fractional load conditions if the CQI is calculated with wideband interference. Further gain can be obtained if the CQI is calculated with local interference, however, in that case, it is necessary to inject a certain time correlation in the transmission patterns due to reporting delay.

关键词： scheduling algorithm Interference Signal to noise ratio Frequency conversion Long Term Evolution Downlink Bandwidth Telecommunication traffic 1f noise Wideband

来源：评论

学校读者我要写书评

暂无评论

QoS Guaranteed Cross-Layer Multiple Traffic scheduling in TDM-OFDMA Wireless Network

QoS Guaranteed Cross-Layer Multiple Traffic Scheduling in TD...

引用

IEEE International Conference on Communications (ICC)

作者： B. Bai Z. Cao W. Chen K. B. Letaief Department of Electronic Engineering Tsinghua University Beijing China

In future wireless communication area, a key issue is the resource allocation and scheduling over wireless channel. Various aspects of this issue have been studied. However, few studies are on the QoS guaranteed uplink multiple traffic scheduling in multi-user wireless network. The scheduling problem is addressed in this paper. We consider the TDM-OFDMA uplink multi-access queuing system with four types of traffic. Each type has specific QoS requirements, such as minimum rate, maximum latency and maximum jitter. This QoS guaranteed cross-layer scheduling issue is modeled as a convex optimization problem. We also prove our scheduling method can guarantee the minimum rate, maximum latency and maximum jitter asymptotically, meanwhile it also minimizes the residual integrated workload. According to the solvability of this optimization problem, we define the scheduling algorithm stability region, and design a heuristic algorithm for connection admission control. The numerical results show the substantial performance of the proposed algorithm.

关键词： Telecommunication traffic Wireless networks Traffic control Delay Jitter scheduling algorithm Wireless communication Resource management Design optimization Stability

来源：评论

学校读者我要写书评

暂无评论

Partitioned Fixed-Priority Preemptive scheduling for Multi-core Processors

Partitioned Fixed-Priority Preemptive Scheduling for Multi-c...

引用

Euromicro Conference on Real-Time Systems

作者： Karthik Lakshmanan Ragunathan Rajkumar John Lehoczky Carnegie Mellon University Pittsburgh PA USA

ISBN: (纸本)9781424444960

Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic real-time tasks on multi-core processors using fixed-priority preemptive scheduling. Specifically, we focus on the partitioned (static binding) approach, which statically allocates tasks to processing cores. The well-established 50% bound for partitioned multiprocessor scheduling [10] can be overcome by task-splitting (TS) [19], which allows a task to be split across more than one core. We prove that a utilization bound of 60% per core can be achieved by the partitioned deadline-monotonic scheduling (PDMS) class of algorithms on implicit-deadline task sets, when the highest-priority task on each processing core is allowed to be split (HPTS). Given the widespread usage of fixed-priority scheduling in commercial real-time and non real-time operating systems (e.g. VxWorks, Linux), establishing such utilization bounds is both relevant and useful. We also show that a specific instance of PDMS_ HPTS, where tasks are allocated in the decreasing order of size, called PDMS_HPTS_ DS, has a utilization bound of 65% on implicit deadline task-sets. The PDMS_ HPTS_ DS algorithm also achieves a utilization bound of 69% on lightweight implicit-deadline task-sets where no single task utilization exceeds 41.4%. The average-case behavior of PDMS_ HPTS_ DS is studied using randomly generated task-sets, and it is seen to have an average schedulable utilization of 88%. We also characterize the overhead of task-splitting using measurements on an Intel Core 2 Duo processor.

关键词： Processor scheduling Multicore processing Job shop scheduling Real time systems Partitioning algorithms scheduling algorithm Linux Operating systems Microprocessors Delay

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 472 473 474 475 476 477 478 479 480 481 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：