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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,081 篇 期刊文献
26 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

6,150 篇 distributed algo...
554 篇 convergence
531 篇 wireless sensor ...
526 篇 algorithm design...
413 篇 optimization
382 篇 computer science
370 篇 distributed comp...
363 篇 network topology
331 篇 routing
279 篇 resource managem...
219 篇 computational mo...
216 篇 protocols
207 篇 computer network...
205 篇 costs
201 篇 approximation al...
197 篇 fault tolerance
187 篇 ad hoc networks
184 篇 bandwidth
181 篇 interference
180 篇 peer to peer com...

机构

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 篇 northeastern uni...
14 篇 purdue univ sch ...
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...

作者

38 篇 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,046 篇 英文
59 篇 其他
38 篇 中文
3 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

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

共 6150 条记录，以下是1601-1610 订阅

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

详细简洁

排序：

distributed Submodular Minimization over Networks: a Greedy Column Generation Approach 57

Distributed Submodular Minimization over Networks: a Greedy ...

引用

57th IEEE Conference on Decision and Control (CDC)

作者： Testa, Andrea Notarnicola, Ivano Notarstefano, Giuseppe Univ Salento Dept Engn Lecce Italy Univ Bologna Dept Elect Elect & Informat Engn Bologna Italy

ISBN: (纸本)9781538613955

Submodular optimization is a special class of combinatorial optimization arising in several machine learning problems, but also in cooperative control of complex systems. In this paper, we consider agents in an asynchronous, unreliable and time-varying directed network that aim at cooperatively solving submodular minimization problems in a fully distributed way. The challenge is that the (submodular) objective set-function is only partially known by agents, that is, each one is able to evaluate the function only for subsets including itself. We propose a distributed algorithm based on a proper linear programming reformulation of the combinatorial problem. Our algorithm builds on a column generation approach in which each agent maintains a local candidate basis and locally generates columns with a suitable greedy inner routine. A key interesting feature of the proposed algorithm is that the pricing problem, which involves an exponential number of constraints, is solved by the agents through a polynomial time greedy algorithm. We prove that the proposed distributed algorithm converges in finite time to an optimal solution of the submodular minimization problem and we corroborate the theoretical results by performing numerical computations on instances of the s-t minimum graph cut problem.

关键词： Minimization Optimization Greedy algorithms distributed algorithms Pricing Machine learning Linear programming

来源：评论

学校读者我要写书评

暂无评论

A Primal Decomposition Method with Suboptimality Bounds for distributed Mixed-Integer Linear Programming 57

A Primal Decomposition Method with Suboptimality Bounds for ...

引用

57th IEEE Conference on Decision and Control (CDC)

作者： Camisa, Andrea Notarnicola, Ivano Notarstefano, Giuseppe Univ Salento Dept Engn Lecce Italy Univ Bologna Dept Elect Elect & Informat Engn Bologna Italy

ISBN: (纸本)9781538613955

In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints. MILPs are NP-hard problems and several challenges arise in a distributed framework, so that looking for suboptimal solutions is of interest. To achieve this goal, the presence of a linear coupling calls for tailored decomposition approaches. We propose a fully distributed algorithm based on a primal decomposition approach and a suitable tightening of the coupling constraints. Agents repeatedly update local allocation vectors, which converge to an optimal resource allocation of an approximate version of the original problem. Based on such allocation vectors, agents are able to (locally) compute a mixed-integer solution, which is guaranteed to be feasible after a sufficiently large time. Asymptotic and finite-time suboptimality bounds are established for the computed solution. Numerical simulations highlight the efficacy of the proposed methodology.

关键词： Resource management distributed algorithms Couplings Heuristic algorithms Optimization Approximation algorithms Smart grids

来源：评论

学校读者我要写书评

暂无评论

distributed Set-Theoretic Parameter Estimation in Networks with Ambiguous Measurements 19

Distributed Set-Theoretic Parameter Estimation in Networks w...

引用

IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Ampeliotis, Dimitris Mavrokefalidis, Christos Berberidis, Kostas Theodoridis, Sergios Univ Patras Dept Comp Engn & Informat Rion 26500 Greece CTI RU 2 Rion 26500 Greece Univ Athens Dept Informat & Telecommun Athens 15784 Greece

ISBN: (纸本)9781538635124

distributed estimation of a parameter vector in a network of sensor nodes with ambiguous measurements is considered. These ambiguities may be due to interference, poor calibration, high noise levels or any other cause. Cooperation among the nodes is required to resolve them. In such a setting, non-convex constraint sets may be required at the nodes, in order to accurately model the local ambiguities. We propose to handle the resulting non-convexity by expressing the involved non-convex sets as unions of convex sets, such that, for each node, only one such convex set is actually relevant to the estimation task. A procedure is employed in which the nodes properly select one of their convex sets with the aim to reach network-wide agreement. In this formulation, agreement can be reached when the nodes select sets with non-empty intersection. To this end, a learning algorithm is proposed and then a sketch of a proof for its convergence under some mild conditions is carried out. Finally, proper numerical results that support the theoretical findings are shown.

关键词： Estimation Task analysis Convergence distributed algorithms Parameter estimation Signal processing algorithms Probability density function"

来源：评论

学校读者我要写书评

暂无评论

Necessary Conditions and Sufficient Conditions for Finding a Common Fixed Point of a Family of Maps Using a distributed Algorithm

Necessary Conditions and Sufficient Conditions for Finding a...

引用

IEEE Conference on Decision and Control

作者： Daniel Fullmer Ji Liu A. Stephen Morse Department of Electrical Engineering Yale University New Haven CT USA Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY USA

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

This paper is concerned with necessary conditions and sufficient conditions which ensure convergence of a distributed algorithm for computing a common fixed point of a family of m > 1 nonlinear maps M i : ℝ n → ℝ n . Each agent i knows the map M i and receives entries of the state vectors of its current neighbors at each time t. Using only this information, each agent recursively updates its own estimate of a common fixed point. Under the assumption of "non-redundancy," and for arbitrary nonlinear maps M i , it is shown that a nonuniformly strongly connected sequence of neighbor graphs is necessary to ensure the distributed algorithm causes all agent estimates to converge to the same common fixed point. Furthermore, sufficient conditions requiring that the maps M i be paracontractions are provided which ensure all agent estimates to converge to the same common fixed point. In the case considering doubly stochastic weight matrices and maps M i which are paracontractions with respect to the 2-norm, both necessary and sufficient conditions are provided. Finally, necessary and sufficient conditions are given which relax the condition of "non-redundancy" and allow for more complicated interactions between the sequence of neighbor graphs and the sets of fixed points.

关键词： Convergence Sufficient conditions distributed algorithms Convex functions Conferences Redundancy Autonomous agents

来源：评论

学校读者我要写书评

暂无评论

A Time Averaging Algorithm for Load Balancing in distributed Power Dispatch

A Time Averaging Algorithm for Load Balancing in Distributed...

引用

Control Technology and Applications (CCTA),

作者： Kenta Hanada Takayuki Wada Izumi Masubuchi Toru Asai Yasumasa Fujisaki Graduate School of Information Science and Technology Osaka University 1–5 Yamadaoka Suita city Osaka JAPAN Graduate School of System Informatics Kobe University 1-1 Rokkodai-cho Nada Kobe city Hyogo JAPAN Graduate School of Engineering Nagoya University Furo-cho Chikusa Nagoya Aichi JAPAN

A time averaging algorithm is proposed for load balancing in distributed power dispatch, where a multi-agent system technique is employed. Each agent is connected to each generator to be controlled, and the agents are linked by the information lines modeled by a directed graph. The objective of this distributed algorithm is to achieve an average load balancing of generators over time. The convergence analysis of the algorithm is provided, which reveals an explicit relation between the number of iterations and the closeness of the ideal balancing in terms of the characteristic values of the graph Laplacian. This result also gives a rigorous stopping rule for the time averaging algorithm. Numerical examples demonstrate preferable behaviors of the proposed algorithm.

关键词： Generators Load management distributed algorithms Noise measurement Convergence Quality of service Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

distributed Garbage Collection for General Graphs 2018

Distributed Garbage Collection for General Graphs

引用

ACM SIGPLAN International Symposium on Memory Management (ISMM)

作者： Brandt, Steven R. Krishnan, Hari Busch, Costas Sharma, Gokarna Louisiana State Univ Baton Rouge LA 70803 USA Kent State Univ Kent OH 44242 USA

ISBN: (纸本)9781450358019

We propose a scalable, cycle-collecting, decentralized, reference counting garbage collector with partial tracing. The algorithm is based on the Brownbridge system but uses four different types of references to label edges. Memory usage is O(logn) bits per node, where n is the number of nodes in the graph. The algorithm assumes an asynchronous network model with a reliable reordering channel. It collects garbage in O(Ea) time, where Ea is the number of edges in the induced subgraph. The algorithm uses termination detection to manage the distributed computation, a unique identifier to break the symmetry among multiple collectors, and a transaction-based approach when multiple collectors conflict. Unlike existing algorithms, ours is not centralized, does not require barriers, does not require migration of nodes, does not require back-pointers on every edge, and is stable against concurrent mutation.

关键词： distributed algorithms Garbage collection distributed memory distributed Garbage Collection

来源：评论

学校读者我要写书评

暂无评论

distributed reconfigurable formation generator for Mini Aerial Vehicles

Distributed reconfigurable formation generator for Mini Aeri...

引用

25th IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Brinon-Arranz, Lara Muschinowski, Matthieu Dumon, Jonathan Marchand, Nicolas Univ Grenoble Alpes CNRS Grenoble INP GIPSA Lab Grenoble France

ISBN: (纸本)9781538680940

This video presents a distributed trajectory generator for formation control of multi-robot systems. The desired formation is defined by its geometric parameters but the position of each robot in the formation is not predefined a priori. The contribution is the design of a distributed algorithm to compute the robots' positions with respect to a given target while maintaining a particular formation which can be reconfigured on-line. A tracking controller ensures the convergence of the robots to their desired positions.

关键词： Generators Intelligent robots Trajectory Multi-robot systems distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Coestimation in Heterogeneous Sensor Networks with Time-Varying Active and Passive Node Roles

Distributed Coestimation in Heterogeneous Sensor Networks wi...

引用

American Control Conference

作者： Tran, Dzung Yucelen, Tansel Jagannathan, Sarangapani Casbeer, David Univ S Florida Mech Engn Dept Tampa FL 33620 USA Univ S Florida Lab Auton Control Informat & Syst LACIS Tampa FL 33620 USA Missouri Univ Sci & Technol Elect & Comp Engn Dept Rolla MO 65409 USA Missouri Univ Sci & Technol Embedded Control Syst & Networking Lab ECSNL Rolla MO 65409 USA Air Force Res Lab Autonomous Control Branch Wright Patterson AFB OH 45433 USA

ISBN: (纸本)9781538654286

In this paper, we address the problem of system theoretic dynamic information fusion in time-varying heterogeneous sensor networks. This class of sensor networks involves nodes that receive observations from a process of interest (active nodes) and nodes that do not receive any information (passive nodes), where the active and passive node roles can be varying with respect to time. At any given time, in addition, active nodes are allowed to have nonidentical modalities such that they can observe different measurements from the process. Specifically, we propose a new distributed input and state "coestimation" architecture for time-varying heterogeneous sensor networks, where time evolution of input and state updates of each node both depend on the local input and state information exchanges. The stability and performance of the overall sensor network are guaranteed once the local sufficient stability conditions for each node are satisfied. As compared with our recent distributed input and state "estimation" approach for the same problem, where time evolution of input (respectively, state) update of each node only depends on the local input (respectively, state) information exchange, our illustrative numerical example also demonstrates a substantially improved dynamic input and state fusion performance.

关键词： Numerical stability Stability analysis distributed algorithms Symmetric matrices Nickel Electronic mail Eigenvalues and eigenfunctions"

来源：评论

学校读者我要写书评

暂无评论

Self-Organized Disaster Management System by distributed Deployment of Connected UAVs

Self-Organized Disaster Management System by Distributed Dep...

引用

International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)

作者： Yann Busnel Christelle Caillouet David Coudert IRISA IMT Atlantique Rennes France Inria CNRS I3S Université Côte d' Azur France

ISBN: (数字)9781728149202

ISBN: (纸本)9781728149219

Providing network services access anytime and anywhere is nowadays a critical issue, especially in disaster emergency situations. A natural response to such a need is the use of autonomous flying drones to help finding survivors and provide network connectivity to the rescue teams. We propose VESPA, a distributed algorithm using only one-hop information of the drones, to discover targets with unknown location and auto-organize themselves to ensure connectivity between them and the sink in a multi-hop aerial wireless network. We prove that connectivity, termination and coverage are preserved during all stages of our algorithm, and we evaluate the algorithm performances through simulations. Comparison with a prior work shows the efficiency of VESPA both in terms of discovered targets and number of used drones.

关键词： Drones Monitoring Base stations Sensors Disaster management distributed algorithms Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

distributed Connectivity Control in Low Probability of Detection Operations

Distributed Connectivity Control in Low Probability of Detec...

引用

Asian Control Conference

作者： Brendan Sims Mohammad Zamani Robert Hunjet Land Division Defence Science and Technology (DST) Group Edinburgh SA Australia

ISBN: (纸本)9781728102634

In this paper, we study the problem of distributed network topology control in order to minimise the received power of network communications at an adversary location. The proposed approach utilises a market-based distributed decision making mechanism to coordinate the deletion of links that contribute most to the received power at the adversary location whilst maintaining network connectivity. Given an initially strongly connected network and static agents, our approach guarantees that the network remains strongly connected and the received power at an adversary location is asymptotically minimised to a greedy optimal solution. The effectiveness of our approach is illustrated in a number of simulations.

关键词： Network topology Topology Knowledge engineering Minimization Silicon Optimization distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 157 158 159 160 161 162 163 164 165 166 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：