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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

10,732 篇 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...
946 篇 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,592 篇 英文
82 篇 其他
58 篇 中文

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

共 10732 条记录，以下是4391-4400 订阅

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

详细简洁

排序：

Improving generalization capability of neural networks based on simulated annealing

Improving generalization capability of neural networks based...

引用

Congress on Evolutionary Computation

作者： Yeejin Lee Jong-Seok Lee Sun-Young Lee Cheol Hoon Park School of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology South Korea

This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorithms overcome the limitation of local optimization by the conventional gradient-based training methods and perform global optimization of the weights of the neural networks. Especially, the multiobjective training algorithm is designed to enhance generalization capability of the trained networks by minimizing the training error and the dynamic range of the network weights simultaneously. For fast convergence and good solution quality of the algorithms, we suggest the hybrid simulated annealing algorithm with the gradient-based local optimization method. Experimental results show that the performance of the trained networks by the proposed methods is better than that by the gradient-based local training algorithm and, moreover, the generalization capability of the networks is significantly improved by preventing overfitting phenomena.

关键词： Neural networks Simulated annealing Signal processing algorithms Optimization methods Backpropagation algorithms Stochastic processes Iterative algorithms Training data scheduling algorithm Cost function

来源：评论

学校读者我要写书评

暂无评论

The effects of quantum size on deficit round robin performance

The effects of quantum size on deficit round robin performan...

引用

IEEE Region 10 International Conference TENCON

作者： Teck Peow Lee Tarith Devadason John Siliquini Networking Research Laboratory-WATRI University of Western Australia Crawley Australia

Round robin (RR) scheduling in packet switched networks with segmentation and reassembly (S&R), provides equal sharing of transmission link resources. ATM networks can be given as an example where RR scheduling can be deployed for equal sharing. With varying packet sizes and in the absence of S&R, packet by packet RR results in unfair sharing in favour of longer packets. Deficit round robin (DRR) scheduling has been proposed to alleviate this problem. Our results show that measures taken to reduce the per packet scheduling complexity of DRR also results in a significant level of unfairness in favor of longer packets. However, such unfairness is only significant at the tail of a data transfer and its effect on the overall data transfer becomes less significant as the size of the transfer increases. On the other hand, RR with S&R does not exhibit the unfairness seen in DRR.

关键词： Round robin Telecommunication traffic scheduling algorithm Throughput Australia Laboratories Packet switching Asynchronous transfer mode Tail Protection

来源：评论

学校读者我要写书评

暂无评论

An Opportunistic Beamforming Technique Using a Quantized Codebook

An Opportunistic Beamforming Technique Using a Quantized Cod...

引用

IEEE 65th Vehicular Technology Conference (VTC-Spring 2007), vol.4

作者： Jiwon Kang In-Kyeong Choi Dong-Seung Kwon Chungyong Lee Department of Electrical and Electronic Engineering Yonsei University Seoul South Korea Electronics and Telecommunications Research Institute Taejon South Korea

Opportunistic beamforming is a powerful technique increasing system throughput in a static channel environment. Since the opportunistic beamforming technique requires quite large user population to exploit sufficient multiuser diversity, a Codebook-based Opportunistic BeamForming (COBF) technique is proposed. The COBF technique uses a unitary matrix, which changes with time, to induce larger and faster channel fluctuations in the static channel. Also, the COBF technique uses a codebook to provide further selection diversity to the conventional opportunistic beamforming technique to overcome the problem of limited multiuser diversity in a small population. Compared to the recently proposed multiple-pilot based opportunistic beamforming technique in [8], the COBF technique reduces required number of pilots. Moreover, since the size of codebook, not the number of pilots, determines the amount of supplementary selection diversity, the system throughput can be increased without limitation from the number of pilots. Some computer simulation results show that system throughput of the COBF technique is higher than that of other conventional techniques and required number of unitary matrices, which needs to be kept as a memory at mobile stations, is only ten in a simulation environment.

关键词： Array signal processing Feedback Interference Fluctuations Throughput Downlink Mobile antennas Receiving antennas Diversity methods scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid Maximal Matching for Input Buffered Crossbar Switches

Hybrid Maximal Matching for Input Buffered Crossbar Switches

引用

Annual Conference on Communication Networks and Services Research (CNSR)

作者： Choudhury A. Al Sayeed Dewan Tanvir Ahmed Akbar Ghaffar Pour Rahbar School of Information Technology & Engineering University of Ottawa ONT Canada

To alleviate the problems of network bottleneck in speed networks, it is important to have faster switching and certainly efficient scheduling algorithms. Optical switches are becoming more popular because of their faster switching speeds and higher reliability as compared to their electronic counterpart. Suitable scheduling algorithms are needed to be developed that will improve the utilization of the switch bandwidth, as well as reduce the scheduling overhead. However, most of the present scheduling algorithms try to optimize either the switch bandwidth or the overhead. In this paper, we propose one new scheduling algorithm named as hybrid maximal matching (HMM) that provides a perfect balance between these two performance criteria and proves itself suitable for large size optical switches. The proposed HMM algorithm is simple to implement and arrives with a complexity of at most 0(N) for an NxN input queued crossbar switch.

关键词： Impedance matching Optical switches scheduling algorithm Bandwidth Optical buffering Hidden Markov models Optical packet switching Throughput Fabrics Micromechanical devices

来源：评论

学校读者我要写书评

暂无评论

Aggressive look-ahead earliest deadline first algorithm

Aggressive look-ahead earliest deadline first algorithm

引用

IEEE Region 10 International Conference TENCON

作者： Lih-Yih Chiou Hsin-Ei Lim Yi-Siou Chen Department of Electrical Engineering National Cheng Kung University Tainan Taiwan

Dynamic voltage and frequency scaling technology is a promising way to save system energy. We proposed an energy-efficient scaling algorithm which utilizes both static and dynamic slack to adjust the frequency and voltage of a processor for running periodic tasks. Instead of excessively using up slack for the task under consideration, our proposed algorithm takes a global approach by intelligently assigning proper slices of slack to tasks and scaling the processor correspondingly. Experiments with an example system demonstrate that the energy consumption of our proposed algorithm is not larger than 3% of the theoretical limit.

关键词： Frequency Dynamic voltage scaling Energy consumption Energy management Power system management Hardware Real time systems Batteries scheduling algorithm Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Robust Priority Assignment for Fixed Priority Real-Time Systems

Robust Priority Assignment for Fixed Priority Real-Time Syst...

引用

Real-Time Systems Symposium (RTSS)

作者： R. I. Davis A. Burns Real-Time Systems Research Group Department of Computer Science University of York York UK

This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a "robust" priority ordering: the most appropriate priority ordering to use in a system subject to variable amounts of additional interference from sources such as interrupts, operating system overheads, exception handling, cycle stealing, and task execution time overruns. The paper describes a robust priority assignment algorithm that can find the robust priority ordering for a wide range of fixed priority system models and additional interference functions. Proofs are given for a number of interesting theorems about robust priority assignment, and the circumstances under which a "deadline minus jitter" monotonic partial ordering forms part of the robust ordering. The paper shows that "deadline minus jitter" monotonic priority ordering is the robust priority ordering for a specific class of system, and that this property holds essentially independent of the additional interference function.

关键词： Robustness Real time systems Interference Job shop scheduling Jitter scheduling algorithm Operating systems Computer science Processor scheduling Switches

来源：评论

学校读者我要写书评

暂无评论

A Framework for Opportunistic Allocation of Wireless Resources

A Framework for Opportunistic Allocation of Wireless Resourc...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

作者： Yun Hou Kin K. Leung Electrical and Electronic Engineering Dept Imperial College London London UK

Wireless multi-hop, mesh networks are being considered as a candidate to backhaul data traffic from access networks to the wired Internet. To enhance system performance, scheduling algorithms for wireless mesh networks are desirable to take advantage of multi-user diversity resulted from time-varying channel condition and space-varying path loss. Although many existing scheduling algorithms or medium access protocols have been adopted for the wireless mesh networks, they do not perform well, given that the algorithms are devised for wireless access. In this paper, we study the computational complexity in finding the optimal schedule for a mesh network with time-division-duplexing (TDD) operations. We propose a novel heuristic distributed scheduling framework for wireless mesh networks with open definitions of utility function. Performance analysis shows that our proposed framework is of polynomial-time complexity. Simulation results compare our framework with the tree-structural approach, and reveal that our proposed framework is highly capable of selecting and scheduling links with high utility in a fully distributed manner.

关键词： Resource management scheduling algorithm Wireless mesh networks Optimal scheduling Mesh networks Spread spectrum communication Telecommunication traffic IP networks System performance Time-varying channels

来源：评论

学校读者我要写书评

暂无评论

A Local Voronoi Diagram-Based Approximate algorithm for Minimum Disc Cover Problem

A Local Voronoi Diagram-Based Approximate Algorithm for Mini...

引用

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

作者： KeZhong Lu XiaoHui Lin FengXia Ding Supercomputing Center Shenzhen University China Department of Electronic Engineering Shenzhen University China

Minimum disc cover problem which is NP-hard is kernel of node scheduling protocol in wireless sensor networks. Size of disc cover set obtained by approximate algorithm determines performance of node scheduling protocol. But the approximation ratios of present approximate algorithms aren't good. This paper proposes a local Voronoi diagrams-based approximate algorithm which can obtain a minimal disc cover set. Theoretical analyses show that the approximation ratio of this algorithm is less than 3. Experiments show that the size of disc cover set obtained by this algorithm is less than 43% of present algorithms and the average coverage degree is around 2.11 which are 1.7 times of optimal.

关键词： Wireless sensor networks Remote monitoring scheduling algorithm Processor scheduling Approximation algorithms Military computing Batteries Distributed computing Kernel Wireless application protocol

来源：评论

学校读者我要写书评

暂无评论

Orthogonal Beamforming for SDMA Downlink with Limited Feedback

Orthogonal Beamforming for SDMA Downlink with Limited Feedba...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Kaibin Huang Jeffrey G. Andrews Robert W. Heath Wireless Networking and Communications Group The University of Texas at Austin Austin TX Wireless Networking and Communications Group The University of Texas at Austin Austin TX USA

On a multi-antenna downlink channel, separation of multiple users by transmit beamforming enables simultaneous transmission from the base station to the users, resulting in high sum throughput. This paper proposes and analyzes a practical algorithm for joint scheduling and orthogonal beamforming, which is enabled by feedback of quantized channel state information (CSI). In this approach, each user quantizes CSI using a codebook comprised of multiple orthonormal vector sets and sends back quantized CSI. Using feedback CSI, the base station jointly selects a set of orthogonal beamforming vectors and schedules a subset of feedback users for downlink transmission such that the throughput is maximized. For moderate to large numbers of users, the proposed algorithm achieves higher sum capacities than the conventional ones.

关键词： Array signal processing Multiaccess communication Downlink Base stations Throughput Information analysis algorithm design and analysis scheduling algorithm State feedback Channel state information

来源：评论

学校读者我要写书评

暂无评论

On Portfolios for Backtracking Search in the Presence of Deadlines

On Portfolios for Backtracking Search in the Presence of Dea...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Huayue Wu Peter van Beek School of Computer Science University of Waterloo Waterloo Ontario Canada Univ. of Waterloo Waterloo

Constraint satisfaction and prepositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorithms - a selection of one or more algorithms plus a schedule for executing the algorithms - can dramatically improve performance on some instances. In this paper, we consider a setting that often arises in practice where the instances to be solved arise over time, the instances all belong to some class of problem instances, and a limit or deadline is placed on the computational resources that the backtracking algorithm can consume in solving any instance. For such a scenario, we present a simple scheme for learning a good portfolio of backtracking algorithms from a small sample of instances. We demonstrate the effectiveness of our approach through an extensive empirical evaluation on a real-world instruction scheduling testbed.

关键词： Portfolios Processor scheduling scheduling algorithm Costs Artificial intelligence Computer science Calendars Software testing Optical propagation Robustness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 436 437 438 439 440 441 442 443 444 445 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：