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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,041 篇 会议
2,175 篇 期刊文献
34 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

6,250 篇 distributed algo...
547 篇 convergence
545 篇 wireless sensor ...
525 篇 algorithm design...
413 篇 optimization
381 篇 computer science
371 篇 distributed comp...
363 篇 network topology
329 篇 routing
279 篇 resource managem...
219 篇 protocols
212 篇 computational mo...
207 篇 computer network...
202 篇 approximation al...
202 篇 costs
199 篇 fault tolerance
186 篇 ad hoc networks
182 篇 bandwidth
179 篇 peer to peer com...
178 篇 interference

机构

25 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 univ liverpool d...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
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,145 篇 英文
62 篇 其他
38 篇 中文
3 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

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

共 6250 条记录，以下是1401-1410 订阅

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

详细简洁

排序：

A distributed Depth First Search based Algorithm for Edge Connectivity Estimation

A Distributed Depth First Search based Algorithm for Edge Co...

引用

International Conference on Network and Service Management

作者： Onur Ugurlu Vahid Khalilpour Akram Deniz Türsel Eliiyi Izmir Bakircay University Izmir Turkey International Computer Institute Ege University Izmir Turkey

ISBN: (数字)9783903176317

ISBN: (纸本)9781665415477

The edge connectivity of a network is the minimum number of edges whose removal disconnect the network. The edge connectivity determines the minimum number of edge-disjoint paths between all nodes. Hence finding the edge connectivity can reveal useful information about reliability, alternative paths and bottlenecks. In this paper, we propose a cost-effective distributed algorithm that finds a lower bound for the edge connectivity of a network via finding at most c depth-first-search trees, where c is the edge connectivity. The proposed algorithm is asynchronous and does not need any synchronization between the nodes. In the proposed algorithm, the root node starts a distributed depth-first-search algorithm, and the nodes select next node in the tree based on their available edges to maximize the total number of established trees. The simulation results show that the proposed algorithm finds the edge connectivity with an average of 48% accuracy ratio.

关键词： Image edge detection Synchronization Spread spectrum communication distributed algorithms Time complexity Robustness Estimation

来源：评论

学校读者我要写书评

暂无评论

A Heavy-Ball distributed Optimization Algorithm over Digraphs with Row-Stochastic Matrices

A Heavy-Ball Distributed Optimization Algorithm over Digraph...

引用

Chinese Control Conference (CCC)

作者： Yang Shen Shaofu Yang School of Computer Science and Engineering Southeast University Nanjing P. R. China

ISBN: (数字)9789881563903

ISBN: (纸本)9781728165233

In this paper, we address the problem of distributed optimization in a multi-agent system, in which each agent maintains a private objective function and the goal of all agents is to cooperatively minimize the sum of their objects. By combining gradient-tracking method and heavy-ball method, a novel accelerated distributed optimization algorithm is proposed under the scenario that the underlying communication network is general directed with row-stochastic weighted matrix, which is easier to be realized in practice than the case of column-stochastic weighted matrix. It is proved that the algorithm converges at a geometric rate as long as the step-size α and the momentum coefficient β do not exceed certain bounds. Finally, numerical experiments are performed to illustrate the performance of our algorithm.

关键词： Convergence Optimization Acceleration distributed algorithms Electronic mail Linear programming History

来源：评论

学校读者我要写书评

暂无评论

distributed Nash Equilibrium Seeking of Aggregative Games for High-Order Systems

Distributed Nash Equilibrium Seeking of Aggregative Games fo...

引用

Chinese Control Conference (CCC)

作者： Zhongqing Zheng Yanqiong Zhang Bin Zhang Rui Yin School of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou P. R. China School of Automation Hangzhou Dianzi University Hangzhou P. R. China College of Information and Communication National University of Defense and Technology P. R. China School of Electronics and Communication Engineering Zhejiang University City College Hangzhou P. R. China

ISBN: (数字)9789881563903

ISBN: (纸本)9781728165233

In this paper, the Nash equilibrium seeking (NES) problem of aggregative games is investigated for high-order multiagents systems, where the cost function for each agent depends on its decision variable and the aggregate of all other decisions. To solve the problem, we employ the embedded technology to decouple the primal problem into two parts: decision planning and tracking. We first construct a single integrator system for the NES to generate the optimal reference decision trajectory, and then we propose the distributed algorithms to make the nonlinear Euler-Lagrange (EL) systems and the general high-order linear system track the optimal reference decision path, respectively. Finally, simulations are given to validate the effectiveness of the theoretical analysis.

关键词： Games Nash equilibrium distributed algorithms Cost function Linear systems Planning Electronic mail

来源：评论

学校读者我要写书评

暂无评论

distributed Heavy-Ball Nash Equilibrium Seeking Algorithm in Aggregative Games

Distributed Heavy-Ball Nash Equilibrium Seeking Algorithm in...

引用

Chinese Control Conference (CCC)

作者： Chenhui Song Chenpeng Wu Zhongtao Lv Fangshuo Zhang Jingyu Li Shaofu Yang Chien-Shiung Wu College Southeast University Nanjing P. R. China School of Economics and Management Southeast University Nanjing P. R. China School of Computer Science and Engineering Southeast University Nanjing P. R. China

ISBN: (数字)9789881563903

ISBN: (纸本)9781728165233

In this paper, we address the distributed Nash equilibrium seeking problem in an aggregative game, in which each agent is required to optimize a self-interested objective function that depends on both its own decision and the aggregate of all agents' decisions. By integrating the heavy-ball method with consensus-based gradient method, a novel distributed algorithm is proposed for seeking the Nash equilibrium with an improved convergence rate. Rigorous theoretical analysis is provided to prove the convergence of the algorithm. Finally, detailed numerical simulation results are provided to show the effectiveness and the acceleration performance of our algorithm.

关键词： Games Nash equilibrium distributed algorithms Convergence Acceleration Electronic mail Linear programming

来源：评论

学校读者我要写书评

暂无评论

distributed Optimization for Linear Multi-Agent Systems Subject to DoS Attacks

Distributed Optimization for Linear Multi-Agent Systems Subj...

引用

IEEE Conference on Decision and Control

作者： Dan Liu Rong Su School of Electrical and Electronic Engineering Nanyang Technological University Singapore

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

This paper discussed the distributed optimization problem where interagent communication is subject to DoS attacks. An event-based communication strategy is adopted to determine the signal transmission time, and then a resilient control algorithm is put forward to achieve consensus and meanwhile minimize the global objective function. By means of a positive invariant set and a quadratic Lyapunov functional, the convergence of the developed algorithm is guaranteed. The effectiveness of the theoretical result is illustrated by a simulation example.

关键词： Optimization distributed algorithms Convergence Stability analysis Radio frequency Multi-agent systems Linear programming

来源：评论

学校读者我要写书评

暂无评论

distributed Consensus of Second-Order Multi- Vehicle Systems with Heterogeneous and Unavailable Inertia Matrices

Distributed Consensus of Second-Order Multi- Vehicle Systems...

引用

Youth Academic Annual Conference of Chinese Association of Automation (YAC)

作者： Yao Zou Haojie Zhang Wei He Institute of Artificial Intelligence University of Science and Technology Beijing Beijing P. R. China

ISBN: (数字)9781728176840

ISBN: (纸本)9781728176857

The consensus problem of second-order multivehicle systems with inertias in terms of a general directed network topology is studied. Rather than the current consensus algorithms for multi-vehicle systems with just scalar inertias, we allow the inertias to be matrices. What's more, the inertia matrices are assumed to be heterogeneous as well as unavailable. In particular, a fully distributed consensus algorithm is proposed such that global information is unnecessary for the achievement of the consensus objective. Moreover, a novel adaptive strategy is designed to address the dilemma arising from the heterogeneity and unavailability of the inertia matrices. It is demonstrated that, under the strongly connected graph condition, the designed distributed algorithm ensures the asymptotic convergence of the required consensus objective. The efficacy of the developed distributed algorithm is finally validated by numerical simulations.

关键词： Adaptive systems Network topology Decentralized control Consensus algorithm Numerical simulation distributed algorithms Convergence

来源：评论

学校读者我要写书评

暂无评论

distributed Algorithm for Opportunistic Spectrum Access in Dynamic Ad Hoc Networks

Distributed Algorithm for Opportunistic Spectrum Access in D...

引用

International Conference on distributed Computing in Sensor Systems (DCOSS)

作者： Rohit Kumar Sumit. J. Darakt Manjesh K. Hanawal Ming Hsieh Department of Electrical Engineering University of Southern California LA USA Algorithm to Architecture Lab Electronics & Communication Engineering IIIT-Delhi India Industrial Engineering and Operational Research Department IIT Bombay India

ISBN: (数字)9781728143514

ISBN: (纸本)9781728198040

The opportunistic spectrum access (OSA) algorithms allow secondary users (SUs) to exploit vacant channels with an aim to maximize overall spectrum utilization/throughput. The design of OSA algorithm is challenging for ad hoc networks due to lack of coordination among SUs and unknown channel statistics. It becomes even more challenging for the dynamic networks where the SUs can enter or leave the network any time without prior agreement. Most of the existing algorithms assume either prior knowledge of the number of SUs or need wideband sensing to sense all channels simultaneously to guarantee optimal channel allocation among SUs. Our goal in this paper is to develop distributed OSA algorithm for dynamic ad hoc networks that offers higher throughput without compromising on the number of SUs collisions. The proposed distributed algorithm is based on multi-player multi-arm bandit framework and they allow SUs to independently estimate the number of other SUs and channel statistics. We derive the upper bounds on the throughput loss (regret) and number of collisions. Exhaustive synthetic results and experimental results on universal software radio peripherals (USRP) based testbed validate our claims and superiority of the proposed algorithm.

关键词： Heuristic algorithms Throughput Channel estimation Ad hoc networks Sensors Batteries distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Deterministic distributed Expander Decomposition and Routing with Applications in distributed Derandomization

Deterministic Distributed Expander Decomposition and Routing...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Yi-Jun Chang Thatchaphol Saranurak ETH Institute for Theoretical Studies Switzerland Toyota Technological Institute at Chicago USA

ISBN: (数字)9781728196213

ISBN: (纸本)9781728196220

There is a recent exciting line of work in distributed graph algorithms in the CONGEST model that exploit expanders. All these algorithms so far are based on two tools: expander decomposition and expander routing. An ( ε, φ)-expander decomposition removes ε-fraction of the edges so that the remaining connected components have conductance at least φ, i.e., they are φ-expanders, and expander routing allows each vertex v in a φ-expander to very quickly exchange deg(v) messages with any other vertices, not just its local neighbors. In this paper, we give the first efficient deterministic distributed algorithms for both tools. We show that an ( ε, φ) -expander decomposition can be deterministically computed in poly (ε -1 )n o(1) rounds for φ = poly (ε)n -o(1) , and that expander routing can be performed deterministically in poly (φ -1 )n o(1) rounds. Both results match previous bounds of randomized algorithms by [Chang and Saranurak, PODC 2019] and [Ghaffari, Kuhn, and Su, PODC 2017] up to subpolynomial factors. Consequently, we derandomize existing distributed algorithms that exploit expanders. We show that a minimum spanning tree on n -o(1) -expanders can be constructed deterministically in n o(1) rounds, and triangle detection and enumeration on general graphs can be solved deterministically in O(n 0.58 ) and n 2/3+o(1) rounds, respectively. Using similar techniques, we also give the first polylogarithmic-round randomized algorithm for constructing an ( ε, φ) -expander decomposition in poly (ε -1 , logn) rounds for φ = 1/poly(ε -1 , logn). This algorithm is faster than the previous algorithm by [Chang and Saranurak, PODC 2019] in all regimes of parameters. The previous algorithm needs n Ω(1) rounds for any φ ≥ 1/polylogn.

关键词： Routing Graph theory Image edge detection Steiner trees distributed algorithms Tools Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Towards Proved distributed algorithms Through Refinement, Composition and Local Computations

Towards Proved Distributed Algorithms Through Refinement, Co...

引用

IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises

作者： Vinvent Filou Mohamed Mosbah Mohamed Tounsi Univ. Bordeaux LaBRI

ISBN: (纸本)9781479904051

The design and the proof of distributed algorithms are difficult tasks due to the lack of knowledge of the global state and the non determinism in the execution of the processes. Formal methods can guarantee that these algorithms run as designed. In this paper, we show that the proof of complex distributed algorithms can be simplified by combining already proved sub-algorithms. To do so, we use a high level encoding of distributed algorithms in form of graph relabeling systems and we propose a formal proof methodology. The proposed methodology combines refinement and decomposition techniques and relies on the correct-by-construction paradigm used by the Event-B method.

关键词： distributed algorithms Local computation systems Formal method Event-B method

来源：评论

学校读者我要写书评

暂无评论

From Event-B Specifications to Programs for distributed algorithms

From Event-B Specifications to Programs for Distributed Algo...

引用

IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises

作者： Mohamed Tounsi Mohamed Mosbah Dominique Mery Univ. Bordeaux LaBRI Univ. Lorraine LORIA

ISBN: (纸本)9781479904051

Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the formal method Event-B, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distributed algorithms. The resulting code can be run on classical distributed computing systems. To execute the induced programs, we use a tool called Visidia that can be used for experimenting, testing and visualizing programs of distributed algorithms.

关键词： Formal methods Event-B distributed algorithms Local computations Visidia distributed systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 137 138 139 140 141 142 143 144 145 146 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：