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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

63 篇 期刊文献
30 篇 会议
2 篇 学位论文

馆藏范围

95 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

85 篇 工学
- 51 篇 计算机科学与技术...
- 47 篇 电气工程
- 25 篇 信息与通信工程
- 19 篇 控制科学与工程
- 9 篇 软件工程
- 5 篇 电子科学与技术（可...
- 2 篇 测绘科学与技术
- 2 篇 交通运输工程
- 1 篇 机械工程
- 1 篇 航空宇航科学与技...
11 篇 理学
- 7 篇 数学
- 4 篇 物理学
- 1 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
5 篇 医学
- 5 篇 临床医学
4 篇 管理学
- 4 篇 管理科学与工程(可...

主题

95 篇 decentralized al...
8 篇 game theory
6 篇 stochastic optim...
5 篇 directed graphs
5 篇 multi-agent syst...
4 篇 resource managem...
4 篇 convergence
4 篇 optimization
4 篇 multi-robot syst...
4 篇 distributed syst...
4 篇 resource allocat...
4 篇 femtocell
4 篇 first-order meth...
4 篇 heuristic algori...
3 篇 reinforcement le...
3 篇 compressed sensi...
3 篇 computation offl...
3 篇 variance reducti...
3 篇 signal processin...
3 篇 collision avoida...

机构

2 篇 purdue univ sch ...
2 篇 mit dept mech en...
2 篇 tufts univ dept ...
2 篇 kth royal inst t...
2 篇 tufts univ medfo...
2 篇 tufts univ dept ...
2 篇 indian inst sci ...
2 篇 carnegie mellon ...
2 篇 syracuse univ de...
2 篇 carnegie mellon ...
2 篇 univ politecn ca...
2 篇 univ roma la sap...
1 篇 columbia univers...
1 篇 univ patras dept...
1 篇 renault sas
1 篇 cnrs lri iasi in...
1 篇 iit madras dept ...
1 篇 mit lincoln lab ...
1 篇 univ texas austi...
1 篇 department of st...

作者

5 篇 xin ran
5 篇 kar soummya
5 篇 khan usman a.
3 篇 sankar v. udaya
3 篇 sharma vinod
3 篇 dan gyorgy
3 篇 josilo sladana
3 篇 yuan sm
2 篇 takeuchi keigo
2 篇 oriolo giuseppe
2 篇 vendittelli mari...
2 篇 franchi antonio
2 篇 foo brian
2 篇 qureshi muhammad...
2 篇 perez-romero j.
2 篇 giupponi l.
2 篇 van der schaar m...
2 篇 freda luigi
2 篇 sallent o.
2 篇 scutari gesualdo

语言

94 篇 英文
1 篇 中文

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

共 95 条记录，以下是71-80 订阅

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

详细简洁

排序：

QoS Provisioning for Multiple Femtocells via Game Theory

QoS Provisioning for Multiple Femtocells via Game Theory

引用

8th IEEE International Conference on Advanced Networks and Telecommunication Systems - (IEEE ANTS)

作者： Sankar, V. Udaya Sharma, Vinod Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

ISBN: (纸本)9781479958672

We consider a system with multiple Femtocells operating in a Macrocell. The transmissions in one Femtocell interfere with its neighboring Femtocells. Each Femtocell has multiple users each requiring a minimum transmission rate. There is also peak transmit power constraint in each channel to control interference to the BS and the users in the Macrocell. We formulate the problem of channel allocation and power control at the Femtocells as a noncooperative Game. We develop efficient decentralized algorithms to obtain a Nash point and satisfy the QoS of each user.

关键词： Femtocell cellular communication power control QoS Game theory decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

decentralized cooperative exploration: Implementation and experiments

Decentralized cooperative exploration: Implementation and ex...

引用

10th International Conference on Intelligent Autonomous Systems

作者： Franchi, Antonio Freda, Luigi Marchionni, Luca Oriolo, Giuseppe Vendittelli, Marilena Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00185 Rome Italy

ISBN: (纸本)9781586038878

We present an implementation of the SRG method, a decentralized cooperative exploration strategy. In this method, a roadmap of the explored area with the associate safe region is stored in a compact data structure, called Sensor-based Random Graph (SRG). No task decomposition and/or allocation is performed. The roadmap is incrementally built through a simple decentralized mechanism: each robot moves towards its local frontier to access areas that, on the basis of the available information, appear to be unexplored by the rest of the team. A detailed description of the software architecture used to implement the strategy is given. Preliminary experiments with a team of Khepera III robots are presented to show the performance of the proposed technique.

关键词： Cooperative exploration multi-robot systems decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

Team Decision Approach for decentralized Network Selection of Mobile Clients

Team Decision Approach for Decentralized Network Selection o...

引用

5th Joint IFIP Wireless and Mobile Networking Conference (WMNC)

作者： Boudko, Svetlana Leister, Wolfgang Gjessing, Stein Norsk Regnesentral Oslo Norway Univ Oslo Oslo Norway

ISBN: (纸本)9781467329934;9781467329941

We consider a network selection problem for a group of mobile clients that operate in a heterogeneous wireless access network environment and that are equipped with multiple access network interfaces. The involved networks cooperate in order to improve their own, and the mobile clients' performance. We formulate the problem as a team decision problem. In this formulation, several decision variables are involved and these decisions are made by several decision makers with access to different information but contributing to a common goal. The novelty of the proposed approach is that the network selection is done in a decentralized manner with only limited information available to decision makers. We present two decentralized algorithms to this problem, which we compare and evaluate in the OMNet++ simulation environment.

关键词： Wireless networking mobile network selection heterogeneous networks decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

GT-SAGA: A fast incremental gradient method for decentralized finite-sum minimization 59

GT-SAGA: A fast incremental gradient method for decentralize...

引用

59th IEEE Conference on Decision and Control (CDC)

作者： Xin, Ran Li, Boyue Kar, Soummya Khan, Usman A. Carnegie Mellon Univ Pittsburgh PA 15213 USA Tufts Univ Medford MA 02155 USA

ISBN: (纸本)9781728174471

In this paper, we study decentralized solutions for finite-sum minimization problems when the underlying training data is distributed over a network of nodes. In particular, we describe the GT-SAGA algorithm that combines variance reduction and gradient tracking to achieve both robust performance and fast convergence. Variance reduction is implemented locally to asymptotically estimate each local batch gradient at each node, while gradient tracking fuses the local estimated gradients across the nodes. Combining variance reduction and gradient tracking thus enables linear convergence to the optimal solution of strongly-convex problems while keeping a low periteration computation complexity at each node. We cast the convergence and behavior of GT-SAGA and related methods in the context of certain practical tradeoffs and further compare their performance over a logistic regression problem with strongly convex regularization.

关键词： Stochastic optimization first-order methods decentralized algorithms variance reduction

来源：评论

学校读者我要写书评

暂无评论

Selfish Robustness and Equilibria in Multi-Player Bandits 33

Selfish Robustness and Equilibria in Multi-Player Bandits

引用

33rd Conference on Learning Theory (COLT)

作者： Boursier, Etienne Perchet, Vianney Univ Paris Saclay CNRS Ctr Borelli ENS Paris Saclay Cachan France ENSAE Paris CREST Palaiseau France Criteo AI Lab Paris France

Motivated by cognitive radios, stochastic multi-player multi-armed bandits gained a lot of interest recently. In this class of problems, several players simultaneously pull arms and encounter a collision - with 0 reward - if some of them pull the same arm at the same time. While the cooperative case where players maximize the collective reward (obediently following some fixed protocol) has been mostly considered, robustness to malicious players is a crucial and challenging concern. Existing approaches consider only the case of adversarial jammers whose objective is to blindly minimize the collective reward. We shall consider instead the more natural class of selfish players whose incentives are to maximize their individual rewards, potentially at the expense of the social welfare. We provide the first algorithm robust to selfish players (a.k.a. Nash equilibrium) with a logarithmic regret, when the arm performance is observed. When collisions are also observed, Grim Trigger type of strategies enable some implicit communication-based algorithms and we construct robust algorithms in two different settings: the homogeneous (with a regret comparable to the centralized optimal one) and heterogeneous cases (for an adapted and relevant notion of regret). We also provide impossibility results when only the reward is observed or when arm means vary arbitrarily among players.

关键词： Multi-Armed Bandits decentralized algorithms Cognitive Radio Game Theory

来源：评论

学校读者我要写书评

暂无评论

Distributed empirical risk minimization over directed graphs 53

Distributed empirical risk minimization over directed graphs

引用

53rd Asilomar Conference on Signals, Systems, and Computers (ACSSC)

作者： Xin, Ran Sahu, Anit Kumar Kar, Soummya Khan, Usman A. Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Bosch Ctr Artificial Intelligence Pittsburgh PA USA Tufts Univ Dept Elect & Comp Engn Medford MA 02155 USA

ISBN: (纸本)9781728143002

In this paper, we present stochastic optimization for empirical risk minimization over directed graphs. Using a novel information fusion approach that utilizes both row- and column-stochastic weights simultaneously, we propose SAB, a decentralized stochastic gradient method with gradient tracking, and show that the proposed algorithm converges linearly to an error ball around the optimal solution with a constant step-size. We provide a sketch of the convergence analysis as well as the generalization of the proposed algorithm. Finally, we illustrate the theoretical results with the help of experiments with real data.

关键词： Stochastic optimization decentralized algorithms multi-agent systems directed graphs

来源：评论

学校读者我要写书评

暂无评论

Essays on Dynamic Optimization for Markets and Networks

Essays on Dynamic Optimization for Markets and Networks

引用

作者： Gan, Yuanling Columbia University

学位级别：Ph.D., Doctor of Philosophy

We study dynamic decision-making problems in networks and markets under uncertainty about future payoffs. This problem is difficult in general since 1) Although the current decision (potentially) affects future decisions, the decision-maker does not have exact information on the future payoffs when he/she commits to the current decision; 2) The decision made at one part of the network usually interacts with the decisions made at the other parts of the network, which makes the computation scales very fast with the network size and brings computational challenges in practice. In this thesis, we propose computationally efficient methods to solve dynamic optimization problems on markets and networks, specify a general set of conditions under which the proposed methods give theoretical guarantees on global near-optimality, and further provide numerical studies to verify the performance empirically. The proposed methods/algorithms have a general theme as “local algorithms”, meaning that the decision at each node/agent on the network uses only partial information on the network. In the first part of this thesis, we consider a network model with stochastic uncertainty about future payoffs. The network has a bounded degree, and each node takes a discrete decision at each period, leading to a per-period payoff which is a sum of three parts: node rewards for individual node decisions, temporal interactions between individual node decisions from the current and previous periods, and spatial interactions between decisions from pairs of neighboring nodes. The objective is to maximize the expected total payoffs over a finite horizon. We study a natural decentralized algorithm (whose computational requirement is linear in the network size and planning horizon) and prove that our decentralized algorithm achieves global near-optimality when temporal and spatial interactions are not dominant compared to the randomness in node rewards. decentralized algorithms are parameterized by the

关键词： Markets Networks Decision-making problems decentralized algorithms Payoffs

来源：评论

学校读者我要写书评

暂无评论

decentralized GENERALIZED APPROXIMATE MESSAGE-PASSING FOR TREE-STRUCTURED NETWORKS 49

DECENTRALIZED GENERALIZED APPROXIMATE MESSAGE-PASSING FOR TR...

引用

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

作者： Takeuchi, Keigo Toyohashi Univ Technol Dept Elect & Elect Inf Engn Toyohashi Aichi Japan

ISBN: (纸本)9798350344868;9798350344851

This paper proposes decentralized generalized approximate message-passing (D-GAMP) for compressed sensing in a tree-structured network. In contrast to conventional GAMP that needs a central node to gather all measurements on the network, D-GAMP utilizes consensus propagation via message-passing between adjacent nodes to achieve the same performance as centralized GAMP. The Onsager correction in D-GAMP is designed via rigorous state evolution so that the asymptotic Gaussianity of estimation errors in D-GAMP is guaranteed in each iteration for consensus propagation. By following a recently developed long-memory proof strategy, state evolution recursion for Bayes-optimal D-GAMP is proved to converge toward the Bayes-optimal fixed point-achieved by Bayes-optimal centralized GAMP-when the fixed point is unique.

关键词： Compressed sensing generalized approximate message-passing decentralized algorithms tree-structured networks state evolution

来源：评论

学校读者我要写书评

暂无评论

decentralized LOW RANK MATRIX RECOVERY FROM COLUMN-WISE PROJECTIONS BY ALTERNATING GD AND MINIMIZATION 49

DECENTRALIZED LOW RANK MATRIX RECOVERY FROM COLUMN-WISE PROJ...

引用

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

作者： Moothedath, Shana Vaswani, Namrata Iowa State Univ Ames IA 50011 USA

ISBN: (纸本)9798350344868;9798350344851

This work studies our recently developed algorithm, decentralized alternating projected gradient descent algorithm (Dec-AltGDmin), for recovering a low rank (LR) matrix from independent column-wise linear projections in a decentralized setting. This means that the observed data is spread across L agents and there is no central coordinating node. Since this problem is non-convex and since it involves a subspace recovery step, most existing literature from decentralized optimization is not useful. We demonstrate using extensive numerical simulations and communication, time, and sample complexity comparisons that (i) existing decentralized gradient descent (GD) approaches fail, and (ii) other common solution approaches on LR recovery literature - projected GD, alternating GD and alternating minimization (AltMin) - either have a higher communication (and time) complexity or a higher sample complexity. Communication complexity is often the most important concern in decentralized learning.

关键词： Low Rank matrix recovery compressed sensing decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

Hereditary Stratigraphy: Genome Annotations to Enable Phylogenetic Inference over Distributed Populations 22

Hereditary Stratigraphy: Genome Annotations to Enable Phylog...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Moreno, Matthew Andres Dolson, Emily Ofria, Charles Michigan Statue Univ E Lansing MI 48824 USA

ISBN: (纸本)9781450392686

Phylogenetic analyses can also enable insight into evolutionary and ecological dynamics such as selection pressure and frequency dependent selection in digital evolution systems. Traditionally, digital evolution systems have recorded data for phylogenetic analyses through perfect tracking where each birth event is recorded in a centralized data structures. This approach, however, does not easily scale to distributed computing environments where evolutionary individuals may migrate between a large number of disjoint processing elements. To provide for phylogenetic analyses in these environments, we propose an approach to infer phylogenies via heritable genetic annotations rather than directly track them. We introduce a "hereditary stratigraphy" algorithm that enables efficient, accurate phylogenetic reconstruction with tunable, explicit trade-offs between annotation memory footprint and reconstruction accuracy. This approach can estimate, for example, MRCA generation of two genomes within 10% relative error with 95% confidence up to a depth of a trillion generations with genome annotations smaller than a kilobyte. We also simulate inference over known lineages, recovering up to 85.70% of the information contained in the original tree using a 64-bit annotation.

关键词： phylogenetics decentralized algorithms digital evolution genetic algorithms genetic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：