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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

3,869 篇 工学
- 2,120 篇 计算机科学与技术...
- 1,869 篇 电气工程
- 957 篇 信息与通信工程
- 902 篇 控制科学与工程
- 389 篇 软件工程
- 151 篇 仪器科学与技术
- 147 篇 电子科学与技术（可...
- 135 篇 机械工程
- 70 篇 交通运输工程
- 39 篇 石油与天然气工程
- 21 篇 网络空间安全
- 20 篇 动力工程及工程热...
- 15 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 8 篇 材料科学与工程（可...
- 7 篇 航空宇航科学与技...
654 篇 理学
- 344 篇 数学
- 269 篇 系统科学
- 70 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
234 篇 管理学
- 226 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
36 篇 医学
- 31 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
2 篇 农学
1 篇 艺术学

主题

6,170 篇 distributed algo...
552 篇 convergence
544 篇 wireless sensor ...
533 篇 algorithm design...
414 篇 optimization
382 篇 computer science
366 篇 distributed comp...
363 篇 network topology
331 篇 routing
279 篇 resource managem...
217 篇 protocols
215 篇 computational mo...
210 篇 computer network...
206 篇 costs
202 篇 approximation al...
197 篇 fault tolerance
187 篇 ad hoc networks
183 篇 bandwidth
180 篇 peer to peer com...
179 篇 interference

机构

24 篇 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 篇 univ cyprus dept...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
22 篇 notarstefano giu...
21 篇 hong yiguang
20 篇 dagdeviren orhan
20 篇 scutari gesualdo
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
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
15 篇 cortes jorge

语言

6,066 篇 英文
59 篇 其他
38 篇 中文
3 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

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

共 6170 条记录，以下是1731-1740 订阅

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

详细简洁

排序：

Decentralized Algorithm for Repeating Pattern Formation by Multiple Robots

Decentralized Algorithm for Repeating Pattern Formation by M...

引用

International Conference on Parallel and distributed Systems (ICPADS)

作者： Shan Jiang Junbin Liang Jiannong Cao Jia Wang Jinlin Chen Zhixuan Liang Department of Computing The Hong Kong Polytechnic University School of Computer and Electronic Information Guangxi University

ISBN: (纸本)9781728125848

Recently, much attention is paid to multi-robot systems due to their widespread applications such as warehouse robotics, persistent surveillance, and exploration of unknown environments. Although urgently required by the applications, coordination among multiple robots remains to be challenging. Among the problems of multi-robot coordination, pattern formation serves a fundamental one. It aims to control a group of robots to form a desired shape with some certain goals such as best formation quality, minimum makespan or minimum total distance. Existing works mainly focus on the formation of certain patterns, such as repeating squares or a circle. those approaches cannot be generalized to arbitrary pattern formation. In this paper, we propose a decentralized algorithm for a multi-robot system to generate a given formation with an arbitrary repeating pattern. We introduce basic pattern graph and assembling graph to define a repeating pattern and formation quality for measurement. Towards solving the repeating pattern formation problem, our approach is divided into two phases. The robots are grouped into multiple basic patterns in the first phase, and the patterns are assembled level by level in the second phase. Simulations and real-world experiments indicate the effectiveness and practicability of our approach.

关键词： Multi-robot system Pattern formation distributed algorithm Pattern formation embryo pattern formation Cooperating robots multi-robot systems repetitive patterns distributed algorithms basic pattern formation Unknown environments Robot Decentralized Robot System

来源：评论

学校读者我要写书评

暂无评论

Redundant Reader Elimination in large-scale IoT City Networks

Redundant Reader Elimination in large-scale IoT City Network...

引用

IEEE International Conference on Computational Intelligence and Virtual Environments for Measurement Systems and Applications

作者： Haoning Shi Huiquan Wang Raad Raad Saeid Iranmanesh Lingshu Meng School of Electronics and Information Engineering SECTE Tianjin Polytechnic University University of Wollongong Tianjin China School of Life Sciences Tianjin Polytechnic University Tianjin China SECTE University of Wollongong Wollongong Australia IT and Engineering Melbourne Institute of Technology Sydney Australia School of Engineering and Information Technologies University of Sydney Sydney Australia

ISBN: (数字)9781538683446

ISBN: (纸本)9781538683453

Radio Frequency Identification (RFID) is an important communication technology for the Internet of Things (IoT). With the development of IoT, RFID technology is widely deployed in large-scaled city networks. Under the circumstances, how to effectively optimize RFID network to decrease the operational cost of IoT is an ongoing research direction. In this area, one of the problems is the redundant reader issue, which means multiple RFID readers cover and interact with one RFID tag or many same tags, thereby resulting in massive energy cost. In order to solve this problem, quite a lot redundant reader elimination algorithms were presented to reduce unnecessary RFID readers. In this paper, the author proposes and compares three existing redundant reader elimination algorithms, including Redundant Reader Elimination Algorithm (RRE), Three-Count Based Algorithm (TCBA) and Threshold Selection Algorithm (TSA), to observe their performances. In the simulations, the author designs three experiments to test RFID reader's detection radius, detection accuracy and algorithmic efficiency by observing the number of readers eliminated in different environmental sets. The simulation results show that TCBA can detect more redundant readers than RRE and TSA, but it costs more time. Compared with TCBA and RRE, the performance of TSA is more practical and efficient to satisfy real RFID environment and market's needs.

关键词： distributed algorithms RFID tags Australia Algorithmic efficiency Greedy algorithms Urban areas

来源：评论

学校读者我要写书评

暂无评论

Adaptive Methods for Irregular Parallel Discrete Event Simulation Workloads 18

Adaptive Methods for Irregular Parallel Discrete Event Simul...

引用

32nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS)

作者： Mikida, Eric Kale, Laxmikant Univ Illinois Champaign IL 61820 USA

ISBN: (纸本)9781450350921

Parallel Discrete Event Simulations (PDES) running at large scales involve the coordination of billions of very. ne grain events distributed across a large number of processes. At such large scales optimistic synchronization protocols, such as TimeWarp, allow for a high degree of parallelism between processes, but with the additional complexity of managing event rollback and cancellation. This can become especially problematic in models that exhibit imbalance resulting in low event efficiency, which increases the total amount of work required to run a simulation to completion. Managing this complexity becomes key to achieving a high degree of performance across a wide range of models. In this paper, we address this issue by analyzing the relationship between synchronization cost and event efficiency. We first look at how these two characteristics are coupled via the computation of Global Virtual Time (GVT). We then introduce dynamic load balancing, and show how, when combined with low overhead GVT computation, we can achieve higher e. ciency with less synchronization cost. In doing so, we achieve up to 2X better performance on a variety of benchmarks and models of practical importance.

关键词： discrete event simulation GVT algorithms continuous GVT parallel runtime system charm++ non-blocking GVT charades load balancing adaptive distributed simulation PDES distributed algorithms ross GVT computation

来源：评论

学校读者我要写书评

暂无评论

The Coverage Control Solutions Based on Evolutionary Game Theory in the Multi-agent Systems*

The Coverage Control Solutions Based on Evolutionary Game Th...

引用

Asian Control Conference

作者： Jian Zhang Jianlei Zhang Department of Automation Nankai University Tianjin China

ISBN: (纸本)9781728102634

As a significant direction of multi-agent system research, the investigation of multi-agent coverage control has attracted increasing attention recent years. The solutions of this problem is related with achieving the maximum coverage of the specific environment while maintaining connectivity. From the perspective of game theory which can characterize the problem of cooperation and conflicts, the coverage control can be regarded as the process of continuous game. Here, a fully distributed and scalable control algorithm is proposed for achieving the coverage control. Each agent can only use the information from neighboring agents within her communication range. And importantly, she does not need to know all the environmental information in advance. Simulations show that the resulted networks are well connected and effective coverage can be realized. Analytical results of the coverage achieved by symmetrically tiled network configurations and other algorithms are provided to evaluate the performance of our algorithm.

关键词： Game theory Games Heuristic algorithms Multi-agent systems Decentralized control Process control distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Consensus over evolutionary graphs 16

Consensus over evolutionary graphs

引用

European Control Conference (ECC)

作者： Smyrnakis, Michalis Freris, Nikolaos M. Tembine, Hamidou New York Univ Abu Dhabi Div Engn Saadiyat Isl POB 129188 Abu Dhabi U Arab Emirates

ISBN: (纸本)9783952426982

We establish average consensus on graphs with dynamic topologies prescribed by evolutionary games among strategic agents. Each agent possesses a private reward function and dynamically decides whether to create new links and/or whether to delete existing ones in a selfish and decentralized fashion, as indicated by a certain randomized mechanism. This model incurs a time-varying and state-dependent graph topology for which traditional consensus analysis is not applicable. We prove asymptotic average consensus almost surely and in mean square for any initial condition and graph topology. In addition, we establish exponential convergence in expectation. Our results are validated via simulation studies on random networks.

关键词： Consensus Evolutionary Games Evolutionary Graphs distributed algorithms Randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for Maximal Matchings and Maximal Independent Sets

Lower Bounds for Maximal Matchings and Maximal Independent S...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Alkida Balliu Sebastian Brandt Juho Hirvonen Dennis Olivetti Mikaël Rabie Jukka Suomela Aalto University Finland ETH Zurich Switzerland Sorbonne Universite Paris France

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in O(Δ + log^* n) communication rounds; here n is the number of nodes and Δ is the maximum degree. The lower bound by Linial (1987, 1992) shows that the dependency on n is optimal: these problems cannot be solved in o(log^* n) rounds even if Δ = 2. However, the dependency on Δ is a long-standing open question, and there is currently an exponential gap between the upper and lower bounds. We prove that the upper bounds are tight. We show that maximal matchings and maximal independent sets cannot be found in o(Δ + log log n / log log log n) rounds with any randomized algorithm in the LOCAL model of distributed computing. As a corollary, it follows that there is no deterministic algorithm for maximal matchings or maximal independent sets that runs in o(Δ + log n / log log n) rounds; this is an improvement over prior lower bounds also as a function of n.

关键词： Color Computational modeling Complexity theory Upper bound distributed algorithms Bipartite graph distributed computing

来源：评论

学校读者我要写书评

暂无评论

A New Dominating Tree Routing Algorithm for Efficient Leader Election in IoT Networks 15

A New Dominating Tree Routing Algorithm for Efficient Leader...

引用

15th IEEE Annual Consumer Communications and Networking Conference (CCNC)

作者： Bounceur, Ahcene Bezoui, Madani Lounis, Massinissa Euler, Reinhardt Teodorov, Ciprian Lab STICC CNRS UMR 6285 Brest France Univ Bretagne Occidentale Brest France Univ Boumerdes Dept Math Boumerdes Algeria ENSTA Bretagne Brest France

ISBN: (纸本)9781538647905

A leader node in Ad hoc networks and especially in WSNs and IoT networks is needed in many cases, for example to find a node with minimum energy or situated on the extreme left of the network. For this kind of applications, algorithms must be robust and fault-tolerant since it is difficult and even impossible to intervene if a node fails. Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm, which is based on a tree routing protocol. It starts from local leaders which will start the process of flooding to determine a spanning tree. During this process their value will be routed. If two spanning trees meet each other then the tree routing the best value will continue its process while the other tree will stop it. The remaining tree is the dominating one and its root will be the leader. This algorithm turns out to be low energy consuming with reduction rates that can exceed 85%. It is efficient and fault-tolerant since it works in the case where any node can fail and in the case where the network is disconnected.

关键词： Wireless Sensor Network IoT Leader Election distributed algorithms Dominating Tree Routing

来源：评论

学校读者我要写书评

暂无评论

Wireless Power Provision as a Public Good 16

Wireless Power Provision as a Public Good

引用

16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Zhang, Meng Huang, Jianwei Zhang, Rui Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China Natl Univ Singapore Dept Elect & Comp Engn Singapore Singapore

ISBN: (纸本)9783903176003

Wireless power transfer (WPT) technology enables a cost-effective and sustainable energy supply in wireless networks, where energy users (EUs) can remotely harvest energy from the wireless signal transmitted by energy transmitters (ETs). However, the broadcast nature of wireless signal makes wireless power a non-excludable public good, which renders the traditional market mechanisms inefficient due to the possibility of the free riders. In this study, we formulate the transmit power provision problem in a single-channel WPT network as a public good provision problem, aiming to maximize the social welfare of all the ET and EUs considering their private information and selfish behaviors. The considered problem also brings both economic and technical challenges in ensuring voluntary participation and distributed algorithm design. To this end, we propose a twophase all-or-none procedure involving a low-complexity Power And Taxation (PAT) Nash mechanism, which ensures voluntary participation, incentive compatibility, and budget balance, and yields the socially optimal transmit power at all Nash equilibria. We further propose a distributed D-PAT Algorithm and prove its convergence by exploiting the connection between the structure of Nash equilibria and that of the optimal solutions to a related optimization problem. Finally, our simulation results validate the PAT Mechanism and the practical algorithm. We show that our design can significantly improve the social welfare compared to the benchmark market mechanism, especially when there are many and relatively comparable EUs.

关键词： Wireless communication Economics distributed algorithms Resource management Proposals Optimization Radio frequency

来源：评论

学校读者我要写书评

暂无评论

Mutual Visibility for Robots with Lights Tolerating Light Faults 32

Mutual Visibility for Robots with Lights Tolerating Light Fa...

引用

32nd IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Sharma, Gokarna Kent State Univ Dept Comp Sci Kent OH 44242 USA

ISBN: (纸本)9781538655559

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles and communicate with other robots using colored lights (the robots with lights model). We study the fundamental MUTUAL VISIBILITY problem of repositioning N robots on a plane so that each robot is visible to all others. We assume obstructed visibility under which a robot cannot see another robot if a third robot is positioned between them on the straight line connecting them. We are interested in light fault-tolerant algorithms;all existing algorithms for this problem are not tolerant to failures on the lights. Therefore, any algorithm for MUTUAL VISIBILITY is required to provide visibility to all N robots, independently of the behavior of the robots with faulty lights. We model light failures as crash faults in which each faulty agent is allowed to set its light to some color, and once the light is set to that color, that color will remain indefinitely thereafter for that agent. In this paper, we provide two algorithms, one tolerant against one faulty robot using 2 colors, which is optimal, and another against (up to) N - 2 faulty robots using 4 colors, in a system of N >= 3 robots.

关键词： distributed algorithms mobile agents lights visibility collisions obstruction crash faults convex hull

来源：评论

学校读者我要写书评

暂无评论

Optimal Price of Anarchy in Cost-Sharing Games

Optimal Price of Anarchy in Cost-Sharing Games

引用

American Control Conference

作者： Rahul Chandan Dario Paccagnan Jason R. Marden University of California Santa Barbara USA Dynamical Systems and Computation UC Santa Barbara USA

ISBN: (纸本)9781538679012;9781538679265

The design of distributed algorithms is central to the study of multiagent systems control. In this paper, we consider a class of combinatorial cost-minimization problems and propose a framework for designing distributed algorithms with a priori performance guarantees that are near-optimal. We approach this problem from a game-theoretic perspective, assigning agents cost functions such that the equilibrium efficiency (price of anarchy) is optimized. Once agents' cost functions have been specified, any algorithm capable of computing a Nash equilibrium of the system inherits a performance guarantee matching the price of anarchy. Towards this goal, we formulate the problem of computing the price of anarchy as a tractable linear program. We then present a framework for designing agents' local cost functions in order to optimize for the worst-case equilibrium efficiency. Finally, we investigate the implications of our findings when this framework is applied to systems with convex, nondecreasing costs.

关键词： Anarchy Nash equilibrium distributed algorithms Frameworks Cost functions Prices Agents

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 170 171 172 173 174 175 176 177 178 179 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：