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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,033 篇 会议
2,163 篇 期刊文献
34 篇 学位论文

馆藏范围

6,230 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,921 篇 工学
- 2,152 篇 计算机科学与技术...
- 1,874 篇 电气工程
- 957 篇 信息与通信工程
- 909 篇 控制科学与工程
- 407 篇 软件工程
- 156 篇 仪器科学与技术
- 154 篇 电子科学与技术（可...
- 135 篇 机械工程
- 70 篇 交通运输工程
- 40 篇 石油与天然气工程
- 21 篇 动力工程及工程热...
- 21 篇 网络空间安全
- 16 篇 土木工程
- 16 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 9 篇 材料科学与工程（可...
- 8 篇 航空宇航科学与技...
691 篇 理学
- 371 篇 数学
- 274 篇 系统科学
- 77 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
234 篇 管理学
- 226 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
37 篇 医学
- 32 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
3 篇 农学
2 篇 艺术学
1 篇 法学

主题

6,230 篇 distributed algo...
545 篇 convergence
545 篇 wireless sensor ...
526 篇 algorithm design...
411 篇 optimization
381 篇 computer science
371 篇 distributed comp...
363 篇 network topology
329 篇 routing
279 篇 resource managem...
219 篇 protocols
210 篇 computational mo...
207 篇 computer network...
202 篇 costs
199 篇 approximation al...
199 篇 fault tolerance
185 篇 ad hoc networks
181 篇 bandwidth
179 篇 peer to peer com...
177 篇 interference

机构

25 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
15 篇 univ liverpool d...
14 篇 suny stony brook...
14 篇 swiss fed inst t...
14 篇 purdue univ sch ...
13 篇 northeastern uni...
12 篇 univ penn dept e...
12 篇 department of el...
12 篇 weizmann inst sc...
11 篇 department of in...
11 篇 georgia state un...
11 篇 purdue univ sch ...
11 篇 shanghai jiao to...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
21 篇 hong yiguang
21 篇 notarstefano giu...
21 篇 scutari gesualdo
20 篇 dagdeviren orhan
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 cortes jorge
16 篇 khan usman a.
16 篇 schmid stefan
16 篇 sharma gokarna
15 篇 peleg david
15 篇 korman amos
15 篇 navarra alfredo
15 篇 mou shaoshuai
15 篇 zeng xianlin

语言

6,125 篇 英文
62 篇 其他
38 篇 中文
4 篇 德文
1 篇 法文
1 篇 葡萄牙文
1 篇 俄文
1 篇 土耳其文

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

共 6230 条记录，以下是411-420 订阅

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

详细简洁

排序：

distributed adaptive algorithms for large dimensional MIMO systems

Distributed adaptive algorithms for large dimensional MIMO s...

引用

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

作者： B. Van Veen O. Leblond V. Mani D. Sebald Electrical and Computer Engineering Department Madison WI USA

A distributed algorithm for MIMO adaptive filtering is introduced. This algorithm distributes the adaptive computation over a set of linearly connected computational modules. Each module transmits data to and receives data from its nearest neighbor. A back-propagation LMS based algorithm is presented for adapting the parameters in each module. The performance surface is explored to identify upper bounds on each parameter and guidelines for choosing the LMS algorithm step sizes. An example illustrates the application of the algorithm.

关键词： Adaptive algorithm MIMO Least squares approximation Vectors distributed algorithms Adaptive filters distributed computing Adaptive systems Drives Nearest neighbor searches

来源：评论

学校读者我要写书评

暂无评论

Convergence of distributed Learning algorithms for Optimal Wireless Channel Allocation

Convergence of Distributed Learning Algorithms for Optimal W...

引用

IEEE Conference on Decision and Control

作者： D.J. Leith P. Clifford Hamilton Institute National University of Ireland Maynooth Ireland

ISBN: (纸本)1424401704;9781424401703

In this paper we establish the convergence to an optimal non-interfering channel allocation of a class of distributed stochastic algorithms. We illustrate the application of this result via (i) a communication-free distributed learning strategy for wireless channel allocation and (ii) a distributed learning strategy that can opportunistically exploit communication between nodes to improve convergence speed while retaining guaranteed convergence in the absence of communication

关键词： Convergence Channel allocation Interference Wireless networks Wireless LAN USA Councils Stochastic processes distributed algorithms Optimal control Land mobile radio cellular systems

来源：评论

学校读者我要写书评

暂无评论

Computation time analysis of centralized and distributed optimization algorithms applied to automated irrigation networks

Computation time analysis of centralized and distributed opt...

引用

Australian Control Conference (AUCC)

作者： Alireza Farhadi Peter M. Dower Michael Cantoni Department of Electrical Engineering Sharif University of Technology Tehran Iran Department of Electrical and Electronic Engineering University of Melbourne Victoria Australia

This paper compares the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the active set method that does not exploit problem structure. The second is distributed and is based on a consensus algorithm, not specifically tailored to account for system structure. It is shown that there is a significant advantage in terms of computation overhead (the time spent computing the optimal solution) in using the second algorithm in large-scale networks. Specifically, for a fixed horizon length the computation overhead of the centralized algorithm grows as O(n 5 ) with the number n of sub-systems. By contrast, it is observed via a combination of analysis and experiment that given n times resources for computation the computation overhead of the distributed algorithm grows as O(n) with the number n of sub-systems.

关键词： Optimization distributed algorithms Approximation algorithms Irrigation Algorithm design and analysis Polynomials Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Uplink and downlink performance evaluation of interference adaptive distributed DCA algorithms in F-TDMA mobile radio networks

Uplink and downlink performance evaluation of interference a...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： R. Verdone A. Zanella CSITE CNR DEIS University of Bologna Bologna Italy

We investigate the impact of user mobility an the performance of interference adaptive (IA) dynamic channel allocation (DCA) schemes. The results have been achieved by means of a simulation tool that takes propagation, mobility, interference, traffic and channel allocation into account. We propose a partially distributed algorithm and compare its performance with that of well known totally distributed IA-DCA schemes (LIA and LTA). Simulation results show that the proposed algorithm outperforms LIA for all the values of offered traffic considered.

关键词： Downlink Channel allocation Land mobile radio distributed algorithms Base stations Interchannel interference Intelligent networks Radio spectrum management Frequency conversion Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity distributed Scheduling algorithms for Wireless Networks

Low-Complexity Distributed Scheduling Algorithms for Wireles...

引用

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

作者： A. Gupta X. Lin R. Srikant Coordinated Science Laboratory and Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign USA School of Electrical and Computer Engineering Purdue University USA

We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules, but which require low complexity due to the fact that they do not necessarily attempt to find maximal schedules. The first algorithm requires each link to collect local queue-length information in its neighborhood, and its complexity is independent of the size and topology of the network. The second algorithm is presented for the node-exclusive interference model, does not require nodes to collect queue-length information even in their local neighborhoods, and its complexity depends only on the maximum node degree in the network.

关键词： Scheduling algorithm Wireless networks Interference Processor scheduling Peer to peer computing distributed algorithms Throughput Computer networks distributed computing Network topology

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed routing algorithms for a synchronous circuit-switched hypercube

Efficient distributed routing algorithms for a synchronous c...

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： M.A. Csoppenszky A.K. Somani Department of Electrical Engineering University of Washington Seattle WA USA

The authors discuss the development and performance of a series of distributed routing algorithms for a synchronous circuit-switched hypercube and enhanced hypercube. Several centralized routing algorithms were developed. All the routing algorithms developed were derived from a single high-level concept of how routing can be accomplished in a circuit-switched hypercube. The routing algorithms were derived from the corresponding packet switching routing algorithm. The routing algorithms have different strengths and weaknesses when compared with one another, and these are considered. It is shown that the highest performing algorithm has an extremely low probability of blocking for the enhanced hypercube and the standard hypercube.< >

关键词： Routing Hypercubes Propagation delay distributed algorithms Integrated circuit interconnections Packet switching Communication switching Concurrent computing Multiprocessor interconnection networks Costs

来源：评论

学校读者我要写书评

暂无评论

Improvement of distributed control algorithms for robots carrying an object

Improvement of distributed control algorithms for robots car...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Y. Asahiro H. Asama I. Suzuki M. Yamashita Kyushu University Fukuoka Japan Institute for Physical and Chemical Research Wako Saitama Japan University of Wisconsin Milwaukee WI USA

We consider the problem of moving a pair of omnidirectional robots carrying a ladder between start and goal positions in an obstacle-free plane as quickly as possible, using a distributed algorithm in which each robot decides its motion individually. In this paper we propose a modification to an existing algorithm for this problem and examine the performance of the resulting algorithm by computer simulation. The simulation results indicate that the resulting algorithm performs better in terms of time than previous algorithms in certain situations, and nearly as well in most other cases.

关键词： distributed control Robot kinematics distributed algorithms Computer simulation Chemicals Robustness Robot control Control systems Control theory Constraint theory

来源：评论

学校读者我要写书评

暂无评论

A Canonical Form for First-Order distributed Optimization algorithms

A Canonical Form for First-Order Distributed Optimization Al...

引用

American Control Conference

作者： Akhil Sundararajan Bryan Van Scoy Laurent Lessard University of Wisconsin-Madison Madison WI 53706 USA Wisconsin Institute for Discovery the University of Wisconsin-Madison

ISBN: (纸本)9781538679012;9781538679265

We consider the distributed optimization problem in which a network of agents aims to minimize the average of local functions. To solve this problem, several algorithms have recently been proposed where agents perform various combinations of communication with neighbors, local gradient computations, and updates to local state variables. In this paper, we present a canonical form that characterizes any first-order distributed algorithm that can be implemented using a single round of communication and gradient computation per iteration, and where each agent stores up to two state variables. The canonical form features a minimal set of parameters that are both unique and expressive enough to capture any distributed algorithm in this class. The generic nature of our canonical form enables the systematic analysis and design of distributed optimization algorithms.

关键词： distributed algorithms gradient methods optimisation

来源：评论

学校读者我要写书评

暂无评论

A Cloud-Based Immersive Learning Environment for distributed Systems algorithms

A Cloud-Based Immersive Learning Environment for Distributed...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Yogesh D. Barve Prithviraj Patil Aniruddha Gokhale Dept of EECS Vanderbilt University Nashville TN USA

As distributed systems become more complex, understanding the underlying algorithms that make these systems work becomes even harder. Traditional learning modalities based on didactic teaching and theoretical proofs alone are no longer sufficient for a holistic understanding of these algorithms. Instead, an environment that promotes an immersive, hands-on learning of distributed system algorithms is needed to complement existing teaching modalities. Such an environment must be flexible to support learning of a variety of algorithms. Moreover, since many of these algorithms share several common traits with each other while differing only in some aspects, the environment should support extensibility and reuse. Finally, it must also allow students to experiment with large-scale deployments in a variety of operating environments. To address these concerns, we use the principles of software product lines (SPLs) and model-driven engineering and adopt the cloud platform to design an immersive learning environment called the Playground of algorithms for distributed Systems (PADS). The research contributions in PADS include the underlying feature model, the design of a domainspecific modeling language that supports the feature model, and the generative capabilities that maximally automate the synthesis of experiments on cloud platforms. A prototype implementation of PADS is described to showcase a distributed systems algorithm illustrating a peer to peer file transfer algorithm based on BitTorrent, which shows the benefits of rapid deployment of the distributed systems algorithm.

关键词： Education Algorithm design and analysis distributed algorithms Software algorithms Peer-to-peer computing Java Software

来源：评论

学校读者我要写书评

暂无评论

Centralized and distributed heuristic algorithms for application-level traffic routing

Centralized and distributed heuristic algorithms for applica...

引用

International Conference on Information Networking

作者： Kazuhito Matsuda Go Hasegawa Satoshi Kamei Masayuki Murata Graduate School of Information Science and Technology Osaka University Suita Osaka Japan NTT Service Integration Laboratories Musashino Tokyo Japan

Recent studies have revealed that the adoption of application-level routing that chooses an end-to-end traffic route relaying other end-hosts can improve certain user-perceived performance factors. However, selfish route selection performed by each application user can lead to a decrease in the route performance due to route overlaps, as well as an increase in the inter-ISP transit cost as a result of utilizing more transit links than in the case of IP routing. In the present paper, we strictly define an optimization problem for selecting application-level traffic routes with the aim to improve end-to-end network performance and reduce transit cost. We then propose centralized and distributed heuristic algorithms based on simulated annealing in order to obtain near-optimal solutions to the problem. We evaluate the performance of the proposed method by assuming that the PlanetLab nodes utilize application-level traffic routing. We show that application-level traffic routing with the proposed algorithms can result in a considerable improvement of network performance. In particular, in the case of using the available bandwidth as the routing metric, the end-to-end network performance can be improved by 87% on average.

关键词： Routing IP networks Peer to peer computing Bandwidth distributed algorithms Extraterrestrial measurements Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：