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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

122 篇 期刊文献
35 篇 会议

馆藏范围

157 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

108 篇 工学
- 90 篇 计算机科学与技术...
- 18 篇 电气工程
- 15 篇 软件工程
- 11 篇 信息与通信工程
- 7 篇 机械工程
- 6 篇 控制科学与工程
- 4 篇 电子科学与技术（可...
- 2 篇 石油与天然气工程
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 轻工技术与工程
- 1 篇 环境科学与工程（可...
- 1 篇 食品科学与工程（可...
63 篇 理学
- 60 篇 数学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
37 篇 管理学
- 37 篇 管理科学与工程(可...
- 9 篇 工商管理
9 篇 经济学
- 9 篇 应用经济学
2 篇 医学
- 2 篇 临床医学
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 教育学
1 篇 农学
- 1 篇 畜牧学
1 篇 军事学

主题

157 篇 on-line algorith...
23 篇 scheduling
21 篇 competitive anal...
17 篇 competitive rati...
11 篇 approximation al...
10 篇 worst-case analy...
6 篇 bin packing
5 篇 single machine
5 篇 makespan
5 篇 delivery time
5 篇 supply chain sch...
4 篇 load balancing
4 篇 lower bound
4 篇 computational ge...
4 篇 randomized algor...
4 篇 combinatorial op...
4 篇 preemption
3 篇 delivery cost
3 篇 graph
3 篇 approximation

机构

6 篇 zhejiang univ co...
6 篇 zhengzhou univ d...
5 篇 zhejiang univ de...
4 篇 mit alfred p slo...
3 篇 zhengzhou univ s...
3 篇 henan univ techn...
2 篇 univ louisville ...
2 篇 zhongyuan univ t...
2 篇 graz tech univ i...
2 篇 zhengzhou inst a...
2 篇 e china univ sci...
2 篇 eindhoven univ t...
2 篇 tech univ berlin...
2 篇 univ calif santa...
2 篇 henan agr univ c...
2 篇 australian natl ...
2 篇 hiroshima univ g...
2 篇 hong kong polyte...
2 篇 fern univ hagen ...
2 篇 beijing univ pos...

作者

6 篇 ye deshi
5 篇 schulz as
5 篇 zhang gc
4 篇 lu lingfa
4 篇 lu xiwen
4 篇 woeginger gj
3 篇 yuan jinjiang
3 篇 averbakh igor
3 篇 tamassia r
3 篇 skutella m
3 篇 vestjens apa
3 篇 zhang guochuan
3 篇 tian ji
3 篇 mu yundong
3 篇 fu ruyan
3 篇 zhang liqi
2 篇 giorgio ausiello
2 篇 he qinming
2 篇 li wenjie
2 篇 cai yuhua

语言

151 篇 英文
6 篇 其他

检索条件"主题词=On-line algorithm"

共 157 条记录，以下是121-130 订阅

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

详细简洁

排序：

Configurable arithmetic arrays with data-driven control

Configurable arithmetic arrays with data-driven control

引用

34th Asilomar Conference on Signals, Systems, and Computers

作者： Parhami, B Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)0780365143

Configurable digital systems offer flexibility that leads to cost reduction, performance tuning, and fault tolerance. While one can use FPGA-based methods to synthesize configurable arithmetic structures, this approach results in limited functionality and/or excessive complexity, given that off-the-shelf FPGAs are endowed with only bit-level computational capabilities. Using serial arithmetic cells can increase the ratio of resources devoted to computation (arithmetic, logic) versus communication (wiring), thereby improving per-chip performance or cost-effectiveness. When combined with pipelining, even the absolute latency can be improved. We argue that a controlled-precision digit-serial additive multiplier constitutes an ideal building block for configurable arithmetic arrays and detail our solutions for control of functionality, selection of precision, and reduction of power dissipation within such an array.

关键词： bit-serial arithmetic digit-pipelined arithmetic FPGA-like arrays DSP hardware on-line algorithm pipelining programmable logic redundant number system

来源：评论

学校读者我要写书评

暂无评论

The Unbounded Parallel-Batching Scheduling Problem with Family Jobs to Minimize Makespan

The Unbounded Parallel-Batching Scheduling Problem with Fami...

引用

Pacific-Asia Conference on Knowledge Engineering and Software Engineering

作者： Meng, Jintao Li, Zhiyong Zhengzhou Inst Aeronaut Ind Management Zhengzhou 450015 Peoples R China

ISBN: (纸本)9783642253485;9783642253492

In this paper we consider the single-machine parallel-batching scheduling problem with family jobs under on-line setting in the sense that we construct our schedule irrevocably as time proceeds and do not know of the existence of any job until its arrival. Our objective is to minimize the maximum completion time of the jobs (makespan). A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. The jobs from different families are incompatible and thus cannot be put in the same batch. We deal with the special variant of the general problem: the unbounded model in which the machine can handle infinite number of jobs simultaneously, the jobs only have two distinct arrival times and come from 2 families. We provide an on-line algorithm with a worst case ratio 1 + alpha where alpha = root 5-1/2.

关键词： Single machine scheduling Worst-case analysis Family on-line algorithm Parallel-hatching scheduling

来源：评论

学校读者我要写书评

暂无评论

Rapid routing with guaranteed delay bounds 39

Rapid routing with guaranteed delay bounds

引用

39th IEEE Real-Time Systems Symposium (RTSS)

作者： Baruah, Sanjoy Washington Univ St Louis MO 63130 USA

ISBN: (纸本)9781538679081

We consider networks in which each individual link is characterized by two delay parameters: a (usually very conservative) guaranteed upper bound on the worst-case delay, and an estimate of the delay that is typically encountered, across the link Given a source and a destination node on such a network and an upper bound on the end-to-end delay that can be tolerated, the objective is to determine routes they typically experience a small delay, while guaranteeing to respect the specified end-to-end upper bound under all circumstances. We formalize the problem of determining such routes as a shortest paths problem on graphs, and derive algorithms for solving this problem optimally.

关键词： Real-time routing end-to-end deadlines shortest paths in graphs adaptive routing on-line algorithm

来源：评论

学校读者我要写书评

暂无评论

On-line multiplication and division in real and complex bases 23

On-line multiplication and division in real and complex base...

引用

23rd IEEE Symposium on Computer Arithmetic (ARITH)

作者： Brzicova, Marta Frougny, Christiane Pelantova, Edita Svobodova, Milena Czech Tech Univ Doppler Inst Math Phys & Appl Math Prague Czech Republic Czech Tech Univ FNSPE Dept Math Prague Czech Republic CNRS UMR 8243 IRIF F-75700 Paris France Univ Paris Diderot Paris France

ISBN: (纸本)9781509016150

A positional numeration system is given by a base and by a set of digits. The base is a real or complex number beta such that |beta| > 1, and the digit set A is a finite set of real or complex digits ( including 0). In this paper, we first formulate a generalized version of the on-line algorithms for multiplication and division of Trivedi and Ercegovac for the cases that beta is any real or complex number, and digits are real or complex. We show that if (beta, A) satisfies the so-called (OL) Property, then on-line multiplication and division are feasible by the Trivedi-Ercegovac algorithms. For a real base beta and alphabet A of contiguous integers, the system (beta, A) has the (OL) Property if #A > |beta|. Provided that addition and subtraction are realizable in parallel in the system (beta, A), our on-line algorithms for multiplication and division have linear time complexity. Three examples are presented in detail: base beta = 3+root 5/2 with alphabet A = {-1, 0, 1};base beta = 2i with alphabet A - {-2, -1, 0, 1, 2} (redundant Knuth numeration system);and base beta = -3/2 + a root 3/3 = -1 + w, where w = exp2i pi/3, with alphabet A = {0,+/- 1, +/- w, +/- w(2)} (redundant Eisenstein numeration system).

关键词： on-line algorithm numeration system

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation on multiprocessor task scheduling with resource augmentation

Performance evaluation on multiprocessor task scheduling wit...

引用

International Symposium on Performance Evaluation Computer and Telecommunication Systems

作者： Ye, Deshi He, Qinming Zhejiang Univ Coll Comp Sci Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)9781565553224

We study the worst-case performance of approximation algorithms for the problem of multiprocessor task scheduling on m identical processors with resource augmentation, whose objective is to minimize the makespan. In this case, the approximation algorithms are given k (k >= 0) extra processors than the optimal off-line algorithm. For on-line algorithms, the Greedy algorithm and shelf algorithms are studied. For off-line algorithm, we consider the LPT (longest processing time) algorithm. Particularly, we prove that the schedule produced by the LPT algorithm is no longer than the optimal off-line algorithm if and only if k >= m - 2.

关键词： Performance evaluation Multiprocessor task scheduling Resource augmentation on-line algorithm Off-line algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Analysis of a Multirobot Graph Exploration Strategy 13

Improved Analysis of a Multirobot Graph Exploration Strategy

引用

13th International Conference on Control Automation Robotics & Vision (ICARCV)

作者： Brass, Peter Vigan, Ivo Xu, Ning CUNY City Coll Dept Comp Sci New York NY 10031 USA CUNY Grad Ctr Dept Comp Sci New York NY 10016 USA

ISBN: (纸本)9781479951994

In this paper, we present an algorithm for exploring an unknown graph with opaque edges by multiple robots. We show that this algorithm is near optimal on graphs with n vertices and superlinear number of edges (i.e., omega(n) edges), and give an adversarial construction to show that the algorithm does not perform well on cyclic graphs with O(n) edges.

关键词： Path Planning for Multiple Mobile Robot Systems Mapping Graph Exploration on-line algorithm

来源：评论

学校读者我要写书评

暂无评论

On-line disjoint path routing for network capacity maximization in ad hoc networks

On-line disjoint path routing for network capacity maximizat...

引用

IEEE Wireless Communications and Networking Conference

作者： Liang, WF Liu, YZ Guo, XX Australian Natl Univ Dept Comp Sci Canberra ACT 0200 Australia

ISBN: (纸本)0780389662

In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e., maximize the number of messages routed successfully by the network without any knowledge of future disjoint path connection request arrivals and generation rates. We first present two on-line algorithms for the problem. One is based on maximizing the network lifetime and another is based on an exponential function of energy utilization at nodes. We then conduct extensive experiments by simulations to analyze the performance of the proposed algorithms. The experimental results show that the proposed algorithms outperform those existing algorithms that do not take into account the power load balancing among the nodes.

关键词： wireless communication network on-line algorithm power awareness ad hoc networks energy consumption optimization disjoint path routing load-balanced routing network capacity

来源：评论

学校读者我要写书评

暂无评论

New Results on Competitive Analysis of Move To Middle(MTM) List Update algorithm using Doubly Linked List 6

New Results on Competitive Analysis of Move To Middle(MTM) L...

引用

6th International Conference on Smart Computing and Communications (ICSCC)

作者： Rakesh, Mohanty Rakesh, Singh Kumar Veer Surendra Sai Univ Technol Dept Comp Sci & Engn Sambalpur 768018 Odisha India

on-line algorithm is an emerging area of research since last five decades with immense theoretical and practical significance. Here the sequence of inputs is received and processed by the algorithm one by one in order. At any instant of time, the algorithm has the knowledge of past and present inputs without knowledge of future inputs. Competitive analysis is a standard performance measure for on-line algorithms in which the performance of an on-line algorithm is compared with that of an optimum offline algorithm. List update problem is a well studied research problem in the area of on-line algorithms, which finds applications in data-compression, dictionary maintenance, collision resolution in hash table, symbol table organization in compiler and computing convex hull in computational geometry. From the literature it is known that Move To Front(MTF) is the best performing deterministic list update algorithm using singly linked list in all practical applications. In this paper, we study and analyse the performance of a deterministic on-line list update algorithm known as Move To Middle(MTM) using doubly linked list. We make a first attempt to find the competitive ratio of MTM algorithm, which was only experimentally studied in the literature. In our study by considering doubly linked list as the data structure and a new variant of standard full cost model, we obtain new competitive analysis result and prove that MTM is 2-competitive. From our competitive analysis result, we show that MTM outperforms MTF. (C) 2018 The Authors. Published by Elsevier B.V.

关键词： on-line algorithm competitive analysis list update problem doubly linked list

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional on-line bin packing problem with rotatable items

Two-dimensional on-line bin packing problem with rotatable i...

引用

6th Annual Conference on International Computing and Combinatorics (COCOON 2002)

作者： Fujita, S Hada, T Hiroshima Univ Grad Sch Engn Dept Informat Engn Higashihiroshima 7398527 Japan

In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is "rotatable" by 90degrees. Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the first algorithm, and the worst-case ratio of the second one is at least 2.25 and at most 2.565. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： on-line algorithm two-dimensional bin packing rotation of items

来源：评论

学校读者我要写书评

暂无评论

The Bounded Single-Machine Parallel-batching Scheduling Problem with Family Jobs for Minimizing Makespan

The Bounded Single-Machine Parallel-batching Scheduling Prob...

引用

3rd International Conference on Environmental Science and Information Application Technology (ESIAT)

作者： Meng, Jintao Lu, Xiaoxu Zhengzhou Inst Aeronaut Ind Management Zhengzhou 450015 Peoples R China

In this paper we consider the problem of scheduling family jobs on a parallel-batching machine under on-line setting, our objective is to minimize the maximum completion time of the jobs (makespan). A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. The jobs from different families are incompatible and thus cannot be put in the same batch. We construct our schedule irrevocably as time proceeds and do not know of the existence of any job until its arrival. We deal with the schedule problem: the bounded model in which the capacity of the machine is limited, and all jobs come from m families. We provide an on-line approximation algorithm with a worst case ratio 2. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Conference ESIAT2011 Organization Commitee.

关键词： single machine scheduling worst-case analysis family on-line algorithm Parallel-batching Scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共16页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：