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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Dispatching rules for production scheduling: A hyper-heuristic landscape analysis

Dispatching rules for production scheduling: A hyper-heurist...

引用

Congress on Evolutionary Computation

作者： Gabriela Ochoa Jose Antonio Vazquez-Rodriguez Sanja Petrovic Edmund Burke School of Computer Science and Information Technology University of Nottingham Nottingham UK

Hyper-heuristics or ldquoheuristics to chose heuristicsrdquo are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in order to solve hard computational search problems. The distinguishing feature of hyper-heuristics, as compared to other heuristic search algorithms, is that they operate on a search space of heuristics rather than directly on the search space of solutions to the underlying problem. Therefore, a detailed understanding of the properties of these heuristic search spaces is of utmost importance for understanding the behaviour and improving the design of hyper-heuristic methods. Heuristics search spaces can be studied using the metaphor of fitness landscapes. This paper formalises the notion of hyper-heuristic landscapes and performs a landscape analysis of the heuristic search space induced by a dispatching-rule-based hyper-heuristic for production scheduling. The studied hyper-heuristic spaces are found to be ldquoeasyrdquo to search. They also exhibit some special features such as positional bias and neutrality. It is argued that search methods that exploit these features may enhance the performance of hyper-heuristics.

关键词： Dispatching Production Space technology Processor scheduling Search problems Heuristic algorithms Design methodology Search methods scheduling algorithm Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Work Stealing Technique and scheduling on the Critical Path

Work Stealing Technique and Scheduling on the Critical Path

引用

International Conference on Grid and Pervasive Computing Workshops, GPC

作者： Christophe Cérin Michel Koskas Laboratoire d'Informatique de Paris-Nord Villetaneuse France Mathématiques et Informatique Appliquées AgroParisTech/INRA UMR 518 Paris France

This paper is about a new framework for high performance thread scheduling based on the work stealing principle when processors may run at different speed. We also take into account memory management problems. We hope that such framework could help multi-threaded or multi-core architects to rely on well founded mathematical results to build appropriate hardware/software schedulers that control the scheduling of threads.

关键词： Yarn Processor scheduling Memory management Hardware scheduling algorithm Parallel processing Concurrent computing Pervasive computing Parallel programming Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel model of large-scale hydrothermal power system optimal scheduling

A novel model of large-scale hydrothermal power system optim...

引用

IEEE PES Power Systems Conference and Exposition, PSCE

作者： Zhen Wang GuangYu He XueQing Chen ShuangXi Zhou Tsinghua University Beijing China

ISBN: (纸本)078038718X

This work presents a new application of linear programming with multiembedded blocks [LPMEB] for optimal scheduling of multilevel interconnected hydrothermal power system. The multiembedded structure is suitable for the multilevel power system operation and the autonomy and confidentiality of each embedded system are maximized while assuring the global economy to the whole system. In this model, each block is a local linear programming [LP] model, or network flow programming [NP] model with side constraints, or their combinations, and it can be embeddable. The hydropart is linear model with the fixed-head hydroplant model. A direct method based on the revised simplex algorithm is proposed to resolve the LPMEB problem, and can be implemented via applied distributed computing technique. Numerical results for the interconnected hydrothermal power system of three gorges, China, are presented.

关键词： Power system modeling Large-scale systems Optimal scheduling Power system interconnection Linear programming AC generators Power generation Costs Distributed computing scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

False path and clock scheduling based yield-aware gate sizing

False path and clock scheduling based yield-aware gate sizin...

引用

International Conference on VLSI Design

作者： Jeng-Liang Tsai Dong Hyun Baik C. Chung-Ping Chen K.K. Saluja Department of Electrical and Computer Engineering University of Wisconsin Madison Madison WI USA Graduate Institute of Electronics Engineering & Department of Electrical Engineering National Taiwan University Taipei Taiwan

ISBN: (纸本)0769522645

Timing margin (slack) needs to be carefully managed to ensure a satisfactory timing yield. We propose a new design flow that combines a false-path-aware gate sizing and a statistical-timing-driven clock scheduling algorithms to maximize timing yield. Our gate sizing algorithm preserves the true path lengths that may otherwise be altered by the traditional gate sizing algorithms due to the presence of false paths. The slack is then distributed to each path according to its path delay uncertainty to maximize the timing yield. Experimental results show that our flow achieves significant timing yield improvements (> 20%) than a traditional flow for a subset of the benchmark circuits with little or negligible area penalty.

关键词： Clocks Timing scheduling algorithm Delay Job shop scheduling Sequential circuits algorithm design and analysis Processor scheduling Drives Engineering management

来源：评论

学校读者我要写书评

暂无评论

scheduling outpatients in hospital examination departments

Scheduling outpatients in hospital examination departments

引用

IEEE International Conference on Industrial Engineering and Engineering Management

作者： Xiaofeng Hu Hui Wu Shaoming Zhang Xing Dai Ye Jin Shanghai Jiao Tong University Shanghai CN Shanghai Ninth People Hospital 200011 China

Outpatients scheduling problem in examination departments allocates hospital equipments to patients and decides on the time to perform examination. This task plays an important role in utilizing the limited hospital equipments efficiently while ensuring quality of service for patients. First, the history examinations data of the hospital is analyzed, and the bottleneck department is defined. Then, some dispatching rules for the outpatient examination are developed to minimize total waiting time subject to minimum idle-time of the equipments in bottleneck department. Computational experiments are performed on the real data collected from Shanghai Ninth People Hospital, and the results show that it is efficient to reduce the waiting time of the outpatients.

关键词： Hospitals Job shop scheduling Dispatching History Magnetic resonance imaging Heuristic algorithms scheduling algorithm Mechanical engineering Quality of service Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Multi-aggregate-query scheduling over Data Streams

Multi-aggregate-query Scheduling over Data Streams

引用

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

作者： Tao Chen Nong Xiao Fang Liu School of Computer National University of Defense Technology Changsha China

With the wide applications of data streams in many fields, such as sensor network monitoring and internet traffic control, query processing over data streams has become increasingly important. In these applications, multiple aggregate queries are registered in the system, and have different sliding window sizes and different frequency upper bounds. How to share the results of these queries is a challenge. Prior work studies how to detect common tasks of these queries and share the results by computing the common tasks only once. Hybrid scheduling first addressed this problem and used the earliest-deadline-first (EDF) method. However, this work did not present a method for computing the scheduling. We formulate the scheduling problem among multiple aggregate queries with different sliding window sizes and different frequency upper bounds over data streams and propose a combination rule to classify these queries. Then, we present an efficient scheduling algorithm to decide whether a query should be executed more often than necessary, as long as the interval between two consecutive executions is less than the frequency upper bound. We also combine our scheduling algorithm with EDF to handle under loaded and overloaded situations. An experimental study shows that our scheduling algorithms are more efficient than no scheduling and EDF in terms of the number of scanned tuples, the throughput and the latency.

关键词： scheduling algorithm Upper bound scheduling Semantics Aggregates Schedules

来源：评论

学校读者我要写书评

暂无评论

Task scheduling in the Georgia Tech digital signal multiprocessor

Task scheduling in the Georgia Tech digital signal multiproc...

引用

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

作者： B.A. Curtis V.K. Madisetti Entry Systems Division IBM Corporation Boca Raton FL USA Electrical Engineering Georgia Institute of Technology Atlanta GA USA

The use of realistic structural and behavioral level descriptions of digital signal multiprocessors to find rate optimal and processor optimal schedules for implementation on multiprocessor digital signal processor (DSP) systems is addressed. Unlike previous work, the digital signal multiprocessor compiler (DSMP-C1) explicitly considers the location of operands, the number of accumulators and registers, the size of on-chip and external memories, the size of communication buffers, and inter-processor communications. The algorithm implicitly retimes and pipelines the flow graph and generates overlapping PSSIMD schedules that are both rate and processor optimal. When compared to previously published scheduling algorithms, the DSMP-C1 algorithm produces significantly shorter iteration periods.< >

关键词： Optimal scheduling scheduling algorithm Processor scheduling Signal processing algorithms Signal processing Digital signal processors Digital signal processing Registers Pipelines Flow graphs

来源：评论

学校读者我要写书评

暂无评论

scheduling an overloaded real-time system

Scheduling an overloaded real-time system

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： Shyh-In Hwang Chia-Mei Chen A.K. Agrawala Computer Engineering and Science Department Yuan Ze Institute of Technology Chungli Taiwan Citicorp Global Information Network Citi Corporation Reston VA USA Institute for Advanced Computer Studies Department of Computer Science University of Maryland College Park MD USA

The real-time systems differ from the conventional systems in that every task in the real-time system has a timing constraint. Failure to execute the tasks under the timing constraints may result in fatal errors. Sometimes, it may be impossible to execute all the tasks in the task set under their timing constraints. Considering a system with limited resources, one solution to handle the overload problem is to reject some of the tasks in order to generate a feasible schedule for the rest. In this paper, we consider the problem of scheduling a set of tasks without preemption in which each task is assigned criticality and weight. The goal is to generate an optimal schedule such that all of the critical tasks are scheduled and then the non-critical tasks are included so that the weight of rejected non-critical tasks is minimized. We consider the problem of finding the optimal schedule in two steps. First, we select a permutation sequence of the task set. Secondly, a pseudopolynomial algorithm is proposed to generate an optimal schedule for the permutation sequence. If the global optimal is desired, all permutation sequences have to be considered. Instead, we propose to incorporate the simulated annealing technique to deal with the large search space. Our experimental results show that our algorithm is able to generate near optimal schedules for the task sets in most cases while considering only a limited number of permutations.

关键词： Real time systems Optimal scheduling Timing scheduling algorithm Processor scheduling Computer networks Computer science Application software Educational institutions Computer errors

来源：评论

学校读者我要写书评

暂无评论

Optimal Sleep-Wake scheduling for Quickest Intrusion Detection Using Wireless Sensor Networks

Optimal Sleep-Wake Scheduling for Quickest Intrusion Detecti...

引用

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

作者： K. Premkumar A. Kumar Department of Electrical Communication Engineering (ECE) Indian Institute of Science Bangalore India

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active . By using a minimal number of sensor devices, we ensure that the energy expenditure for sensin g, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of M k+1 , the number of sensors in the wake state in time slot k + 1, (2) optimal control of q k+1 , the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on M k+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on M k+1 and is maximum for the optimum open loop control on q.

关键词： Intrusion detection Wireless sensor networks Intelligent sensors Sensor fusion scheduling algorithm Open loop systems Testing Optimal control Cost function Sleep

来源：评论

学校读者我要写书评

暂无评论

Efficient Semi-Persistent scheduling for VoIP on EUTRA Downlink

Efficient Semi-Persistent Scheduling for VoIP on EUTRA Downl...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Yong Fan Petteri Lunden Markku Kuusela Mikko Valkama Department of Communications Engineering Tampere University of Technology Tampere Finland Nokia Group Nokia Research Center Helsinki Finland

Evolved UTRA (EUTRA) is currently under standardization within 3GPP as a long-term evolution (LTE) of universal terrestrial radio access (UTRA) air interface. Due to the potentially large number of VoIP users served in this system, related control signaling overhead for VoIP transmissions with traditional full dynamic scheduling scheme could become a bottleneck and limit the system capacity to a greater extent. In this paper, we present a semi-persistent packet scheduling scheme for VoIP to explore the capacity within the limitation of control channel resources. System level simulation results show that semi-persistent scheduling scheme can reduce control channel usage without using packet bundling technique. With 6 control channels, around 310 users per sector can be supported in 5 MHz bandwidth with both discontinuous reception (DRX) enabled and without packet bundling.

关键词： Dynamic scheduling scheduling Resource management Delay scheduling algorithm Downlink Bandwidth

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：