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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,586 篇 会议
719 篇 期刊文献
3 篇 学位论文
1 册 图书

馆藏范围

2,309 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,216 篇 工学
- 1,738 篇 计算机科学与技术...
- 1,178 篇 软件工程
- 870 篇 信息与通信工程
- 612 篇 电气工程
- 196 篇 动力工程及工程热...
- 168 篇 电子科学与技术（可...
- 126 篇 控制科学与工程
- 103 篇 光学工程
- 73 篇 机械工程
- 53 篇 仪器科学与技术
- 50 篇 交通运输工程
- 40 篇 化学工程与技术
- 37 篇 航空宇航科学与技...
- 20 篇 土木工程
- 19 篇 建筑学
- 18 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 农业工程
757 篇 理学
- 461 篇 数学
- 229 篇 物理学
- 46 篇 统计学（可授理学、...
- 45 篇 系统科学
- 40 篇 化学
- 29 篇 生物学
307 篇 管理学
- 169 篇 管理科学与工程(可...
- 153 篇 图书情报与档案管...
- 64 篇 工商管理
32 篇 经济学
- 32 篇 应用经济学
18 篇 医学
- 15 篇 临床医学
17 篇 农学
- 17 篇 作物学
11 篇 法学
6 篇 文学
5 篇 教育学
5 篇 军事学
2 篇 艺术学

主题

2,309 篇 routing algorith...
145 篇 optical networks
97 篇 network topology
94 篇 network routing
77 篇 wireless sensor ...
59 篇 algorithms
44 篇 wavelength assig...
37 篇 network-on-chip
37 篇 interconnection ...
36 篇 routing
34 篇 energy consumpti...
33 篇 wavelength divis...
30 篇 multicast
30 篇 fiber optics and...
29 篇 networks (060.42...
29 篇 quality of servi...
28 篇 ganglia
26 篇 optical signals
26 篇 packet switching
25 篇 networking hardw...

机构

9 篇 beijing univ pos...
8 篇 college of infor...
7 篇 tsinghua univ de...
7 篇 beijing universi...
6 篇 univ glasgow dep...
6 篇 chongqing key la...
5 篇 univ calif davis...
5 篇 univ nebraska de...
5 篇 univ cyprus dept...
4 篇 school of electr...
4 篇 northeastern uni...
4 篇 school of commun...
4 篇 northeastern uni...
4 篇 school of electr...
4 篇 university of el...
4 篇 school of comput...
4 篇 kth royal inst t...
4 篇 columbia univ de...
4 篇 college of compu...
4 篇 kazimierz wielki...

作者

15 篇 ren zhi
14 篇 zhang jie
13 篇 zhao yongli
8 篇 xu gang
8 篇 skeie tor
8 篇 kaneko keiichi
7 篇 wang xingwei
7 篇 duato j
7 篇 huang min
7 篇 peng shietung
6 篇 kumar shashi
6 篇 ebrahimi masoume...
6 篇 ould-khaoua m
6 篇 piechowiak macie...
6 篇 zwierzykowski pi...
6 篇 escudero-sahuqui...
6 篇 palesi maurizio
5 篇 min huang
5 篇 duan xinming
5 篇 duato j.

语言

2,161 篇 英文
79 篇 其他
66 篇 中文
2 篇 西班牙文
2 篇 朝鲜文
1 篇 土耳其文

检索条件"主题词=Routing algorithms"

共 2309 条记录，以下是1101-1110 订阅

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

详细简洁

排序：

The Improvement of Pseudo-Boolean Satisfiability Algorithm for FPGA routing

The Improvement of Pseudo-Boolean Satisfiability Algorithm f...

引用

2nd International Conference on Mechatronics and Intelligent Materials (MIM 2012)

作者： Tang, Yulan Chen, Jianhui Wuxi City Coll Vocat Technol Wuxi 214122 Jiangsu Peoples R China Wuxi Inst Technol Wuxi Jiangsu Peoples R China

ISBN: (纸本)9783037853849

A new routing algorithm is proposed for FPGA to improve the increasing transformation cost of pseudo-Boolean Satisfiability algorithm in the routing process, which combined advantages of pseudo-Boolean Satisfiability and geometric routing algorithm. In the routing process, one of geometric routing algorithm-VPR5.0 was chosen firstly for FPGA routing. If not successful, then use pseudo-Boolean Satisfiability algorithm. Technique of static symmetry-breaking is also adding to carry out pretreatment of pseudo-Boolean constraints, detecting and breaking the symmetries in the routing flow. The purpose was to prune search path, and the cost was consequently reduced. Preliminary experiments results show that the hybrid approach can reduce the runtime observably, speed up the solving process, and have no adverse affect on overall program.

关键词： Benchmarking Field programmable gate arrays routing algorithms

来源：评论

学校读者我要写书评

暂无评论

QOS Constrained routing Algorithm Using Directional Antenna

QOS Constrained Routing Algorithm Using Directional Antenna

引用

International Conference on Wireless and Optical Communications Networks

作者： Divya Gupta Sangeeta Singh Bharti Modi ABV-IIITM Gwalior 474010 India PDPM-IIITDM Jabalpur 482005 India

ISBN: (纸本)9781467359986

Directional antenna provides tremendous performance improvement in an ad hoc network. There are many applications such as multimedia and real time, which requires guaranteed QoS (quality of service) in the network. In this paper, we present QoS routing algorithm which finds a optimal path from source to destination as well as for other nodes in the network. Route discovery is initiated by source node and routing path is selected based on routing metric value which is having delay and bandwidth as constraints. The probability updation rule is used to increase the probability of beam in the direction of successful transmission and it reduces the routing overhead in retransmission. The simulation results demonstrate the routing overhead which reduces as the number of iteration increases. It shows significant improvement in terms of average routing overhead with directional transmission over omnidirectional transmission.

关键词： Directive antennas Quality of service Network routing routing algorithms directional transmission beam direction optimal path Ad hoc networks performance boost destination MULTI-MEDIA SYSTEM iterative methods

来源：评论

学校读者我要写书评

暂无评论

A New Fault-Tolerant routing Algorithm for MALN-2

A New Fault-Tolerant Routing Algorithm for MALN-2

引用

International Conference on Eco-friendly Computing and Communication systems (ICECCS)

作者： Nitin Chauhan, Durg Singh Jaypee Univ Informat Technol PO Waknaghat Solan 173234 Himachal Prades India Uttarakhand Tech Univ Dehra Dun 248007 Uttarakhand India

ISBN: (纸本)9783642321115

In this paper we have presented a new fault-tolerant Irregular Modified Alpha Multi-stage Interconnection Network (MALN-2). MALN-2 is a double switch fault-tolerant interconnection network with more alternate paths with full accessibility. It is better than existing Modified Alpha Network. The paper also presents the fault-tolerant routing Algorithm for the proposed irregular Interconnection Network.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Primary Traffic Based Multihop routing Algorithm Using Cooperative Transmission in Cognitive Radio Ad Hoc Networks

A Primary Traffic Based Multihop Routing Algorithm Using Coo...

引用

IEEE Consumer Communications and Networking Conference (CCNC)

作者： Lin, I-Te Sasase, Iwao Keio Univ Dept Informat & Comp Sci Kohoku Ku Yokohama Kanagawa 2238522 Japan

ISBN: (纸本)9781457720710

We propose a primary traffic based multihop routing with the cooperative transmission (PTBMR-CT) algorithm that enlarges the hop transmission distances to reduce the number of cognitive receivers on the route from the cognitive source (CS) to the cognitive destination (CD). In each hop, from the cognitive nodes in a specified area depending on the status of the primary traffic, the cognitive node that is farthest away from the cognitive sender is selected as the cognitive receiver. However, when the primary source (PS) is transmitting the data to the primary destination (PD), another cognitive node is also selected to be the cognitive receiver for the cooperative transmission from the cognitive nodes that are in a specified area. The cooperative transmission is performed if the PS still transmits the data to the PD when the cognitive receiver of the next hop is being searched. The simulation results show that the average number of cognitive receivers is reduced by the PTBMR-CT compared to the conventional primary traffic based farthest neighbor routing (PTBFNR), and the conventional PTBFNR is outperformed by the PTBMR-CT in terms of the average end-to-end reliability, the average end-to-end throughput, and the average required transmission power of transmitting the data from the CS to the CD.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

AN EFFECTIVE HYBRID routing ALGORITHM FOR OPPORTUNISTIC NETWORKS

AN EFFECTIVE HYBRID ROUTING ALGORITHM FOR OPPORTUNISTIC NETW...

引用

2nd IEEE International Conference on Cloud Computing and Intelligent Systems (CCIS)

作者： Ren, Zhi Zhang, Jian Li, Jibi Lei, Hongjiang Chongqing Univ Posts & Telecommun Chongqing Key Lab Mobile Commun Technol Chongqing 400065 Peoples R China

ISBN: (纸本)9781467318556;9781467318570

Context aware routing (CAR) is a hybrid routing algorithm for opportunistic networks, which uses destination-sequence distance-vector (DSDV) algorithm and probabilistic routing in connected regions and between the connected regions, respectively. We find that the control overhead of CAR is relatively high due to the utilization of DSDV and the default time-to-live (TTL) value of data affects the delivery rate. To solve these problems, we proposed an effective and reliable hybrid routing algorithm (ERHR). In ERHR, the optimized link-state routing version 2 (OLSRv2) is used in connected regions to reduce the control overhead, and the modification of TTL value makes a progress on the aspect of the data delivery rate. Theoretical analysis and simulation results show that the proposed algorithm has a better performance in terms of control overhead, data delivery rate and data retransmission overhead.

关键词： Opportunistic networks routing algorithms Hybrid routing OLSRv2 Overhead

来源：评论

学校读者我要写书评

暂无评论

Power-aware Joint Sensor Selection and routing for Distributed Estimation: a Convex Optimization Approach

Power-aware Joint Sensor Selection and Routing for Distribut...

引用

8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Shah, Santosh Beferull-Lozano, Baltasar Univ Valencia Grp Informat & Commun Syst Inst Robot & Tecnol Informac & Comunicac Paterna 46980 Valencia Spain

ISBN: (纸本)9780769547077

This paper considers the problem of power-efficient distributed estimation of vector parameters related to localized phenomena so that both the subset of sensor selection and the routing structure in a wireless sensor network are optimized jointly in order to obtain the best possible estimation performance at a given querying node, for a given total power budget. We first formulate our problem as an optimization problem and show that it is NP-Hard. Then, we design two algorithms: a fixed-tree relaxation-based and a novel and very efficient local distributed optimization to optimize jointly the sensor selection and the routing structure. We also provide a lower bound for our optimization problem and show that our local distributed optimization algorithm provides a performance that is close to this bound. Although there is no guarantee that the gap between this lower bound and the optimal solution of the main problem is always small, our numerical experiments support that this gap is actually very small in many cases. An important result from our work is that because of the interplay between the communication cost over the links and the gains in estimation accuracy obtained by choosing certain sensors, the traditional shortest-path-tree routing structure, widely used in practice, is no longer optimal, that is, our routing structures provide a better trade-off between the overall power efficiency and the final estimation accuracy obtained at the querying node. Comparing to more conventional sensor selection and fixed routing algorithms, our proposed joint sensor selection and routing algorithms yield a significant amount of energy saving.

关键词： Network routing Sensors energy capacity routing algorithms dynamic efficiency Distribute Convex function

来源：评论

学校读者我要写书评

暂无评论

Efficient graph planarization in sensor networks and local routing algorithm

Efficient graph planarization in sensor networks and local r...

引用

8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Huc, Florian Jarry, Aubin Leone, Pierre Rolim, Jose Ecole Polytech Fed Lausanne LPD CH-1015 Lausanne Switzerland Univ Geneva Dept Comp Sci Geneva Switzerland

ISBN: (纸本)9780769547077

In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC). Our first algorithm computes a planar 2-spanner under light constraints on the edge lengths and induces a total exchange of at most 6n node identifiers. Its total computational complexity is O(n Delta), with Delta the maximum degree of the communication graph. The second algorithm that we present is a simple and efficient algorithm to route messages in this planar graph that requires routing tables with only three entries. We support these theoretical results by simulations showing the robustness of our algorithms when the coordinates are inaccurate.

关键词： routing algorithms planning drawings PLANARISATION efficient algorithm Inaccurate Sensor networks Coordinates Ganglia Communication Research

来源：评论

学校读者我要写书评

暂无评论

Towards Graceful Aging Degradation in NoCs Through an Adaptive routing Algorithm 12

Towards Graceful Aging Degradation in NoCs Through an Adapti...

引用

49th ACM/EDAC/IEEE Design Automation Conference (DAC)

作者： Bhardwaj, Kshitij Chakraborty, Koushik Roy, Sanghamitra Utah State Univ USU BRIDGE Lab Logan UT 84322 USA

ISBN: (纸本)9781450311991

Continuous technology scaling has made aging mechanisms such as Negative Bias Temperature Instability (NBTI) and electromigration primary concerns in Network-on-Chip (NoC) designs. In this paper, we model the effects of these aging mechanisms on NoC components such as routers and links using a novel reliability metric called Traffic Threshold per Epoch (TTpE). We observe a critical need of a robust aging-aware routing algorithm that not only reduces power-performance overheads caused due to aging degradation but also minimizes the stress experienced by heavily utilized routers and links. To solve this problem, we propose an aging-aware adaptive routing algorithm and a router microarchitecture that routes the packets along the paths which are both least congested and experience minimum aging stress. After an extensive experimental analysis using real workloads, we observe a 13%, 12.7% average overhead reduction in network latency and Energy-Delay-Product-Per-Flit (EDPPF) and a 10.4% improvement in performance using our aging-aware routing algorithm.

关键词： NoC Aging NBTI Electromigration routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An MILP-Based Aging-Aware routing Algorithm for NoCs

An MILP-Based Aging-Aware Routing Algorithm for NoCs

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Bhardwaj, Kshitij Chakraborty, Koushik Roy, Sanghamitra Utah State Univ Elect & Comp Engn Logan UT 84322 USA

ISBN: (纸本)9783981080186

Network-on-Chip (NoC) architectures have emerged as a better replacement of the traditional bus-based communication in the many-core era. However, continuous technology scaling has made aging mechanisms such as Negative Bias Temperature Instability (NBTI) and electromigration primary concerns in NoC design. In this paper 1, we propose a novel system-level aging model to model the effects of asymmetric aging in NoCs. We observe a critical need of a holistic aging analysis, which when combined with power-performance optimization, poses a multi-objective design challenge. To solve this problem, we propose a Mixed Integer Linear Programming (MILP)based aging-aware routing algorithm that optimizes the various design constraints using a multi-objective formulation. After an extensive experimental analysis using real workloads, we observe a 62.7%, 46% average overhead reduction in network latency and Energy-Delay-Product-Per-Flit (EDPPF) and a 41% improvement in Instructions Per Cycle (IPC) using our aging-aware routing algorithm.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Fuzzy Logic Based routing Scheme for Bufferless NoCs

A Dynamic Fuzzy Logic Based Routing Scheme for Bufferless No...

引用

15th IEEE International Conference on Computational Science and Engineering (CSE) / 10th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Chrysostomou, C. Tatas, K. Runcan, A. R. Frederick Univ Dept Comp Sci & Engn Nicosia Cyprus Frederick Res Ctr Nicosia Cyprus

ISBN: (纸本)9781467351652;9780769549149

This paper proposes a novel, adaptive routing scheme for Network-on-Chip (NoC). In particular, the proposed routing scheme decides on the output port of an incoming flit by taking into account the dynamic traffic and power consumption on neighboring router links. For that, a simple, generic, and efficient nonlinear control law is built, based on fuzzy logic control, to dynamically calculate the input links cost. Although we focus on bufferless NoCs, it can also be applied to buffered NoCs as well. The additional digital logic required for the proposed scheme is not in the router critical path, and, therefore, imposes no additional latency. We demonstrate, via simulative evaluation of light to heavy congestion conditions, that the proposed scheme outperforms representative conventional counterparts in terms of throughput and latency. Thus, the effectiveness of the proposed scheme is shown, as the performance is consistently better.

关键词： NoC routing algorithms Fuzzy Logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共231页 << < 107 108 109 110 111 112 113 114 115 116 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：