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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

67 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

30 篇 工学
- 29 篇 计算机科学与技术...
- 10 篇 信息与通信工程
- 9 篇 电气工程
- 5 篇 软件工程
- 2 篇 控制科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 石油与天然气工程
- 1 篇 网络空间安全
25 篇 管理学
- 25 篇 管理科学与工程(可...
- 4 篇 工商管理
17 篇 理学
- 15 篇 数学
- 5 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 系统科学
2 篇 经济学
- 2 篇 应用经济学

主题

11 篇 games
10 篇 optimization
8 篇 nash equilibrium
6 篇 convergence
5 篇 routing
4 篇 vectors
4 篇 cost function
4 篇 heuristic algori...
3 篇 network topology
3 篇 bandwidth
3 篇 resource managem...
3 篇 social network s...
3 篇 game theory
3 篇 mobile communica...
3 篇 delay
2 篇 delays
2 篇 markov processes
2 篇 handover
2 篇 network routing
2 篇 ieee 802.11 stan...

机构

2 篇 university of av...
2 篇 dipartimento di ...
2 篇 balvatnik school...
2 篇 department of el...
2 篇 departamento de ...
2 篇 edward s. rogers...
2 篇 laboratorio di m...
1 篇 beijing univ pos...
1 篇 lia univesite d'...
1 篇 cy univ etis umr...
1 篇 institute of con...
1 篇 tech univ cluj n...
1 篇 dept. of electri...
1 篇 national institu...
1 篇 supelec e3s f-91...
1 篇 university of ed...
1 篇 lehrstuhl ii für...
1 篇 avignon univ lia...
1 篇 graduate school ...
1 篇 department of el...

作者

3 篇 hayel yezekael
2 篇 lasaulce samson
2 篇 mertikopoulos pa...
2 篇 echabbi loubna
2 篇 ariel orda
2 篇 altman eitan
2 篇 nino-mora jose
2 篇 moshe haviv
2 篇 beaude olivier
2 篇 kameda hisao
1 篇 igal milchtaich
1 篇 andrés arcia-mor...
1 篇 george athanasio...
1 篇 lejosne yohan
1 篇 montavont nicola...
1 篇 jason r. marden
1 篇 quadri dominique
1 篇 yohan lejosne
1 篇 hamlaoui chahine...
1 篇 zhang zhicai

语言

68 篇 英文

检索条件"任意字段=International Conference on NETwork Games, Control and Optimization, NetGCooP 2011"

共 68 条记录，以下是51-60 订阅

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

详细简洁

排序：

Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policy

Sensor scheduling for hunting elusive hiding targets via whi...

引用

international conference on network games, control and optimization, netgcoop 2011

作者： Nino-Mora, Jose Villar, Sofia S. Spain

ISBN: (纸本)9781467303842

We consider a sensor scheduling model where a set of identical sensors are used to hunt a larger set of heterogeneous targets, each of which is located at a corresponding site. Target states change randomly over discrete time slots between "exposed" and "hidden," according to Markovian transition probabilities that depend on whether sites are searched or not, so as to make the targets elusive. Sensors are imperfect, failing to detect an exposed target when searching its site with a positive misdetection probability. We formulate as a partially observable Markov decision process the problem of scheduling the sensors to search the sites so as to maximize the expected total discounted value of rewards earned (when targets are hunted) minus search costs incurred. Given the intractability of finding an optimal policy, we introduce a tractable heuristic search policy of priority-index type based on the Whittle index for restless bandits. Preliminary computational results are reported showing that such a policy is nearly optimal and can substantially outperform the myopic policy and other simple heuristics. © 2011 INRIA.

关键词： optimization

来源：评论

学校读者我要写书评

暂无评论

Market share game with adversarial Access providers: A neutral and a non-neutral network analysis

Market share game with adversarial Access providers: A neutr...

引用

international conference on network games, control and optimization, netgcoop 2011

作者： Baslam, Mohamed El-Azouzi, Rachid Sabir, Essaid Echabbi, Loubna LIMIARF University of Mohammed V Faculty of Sciences 4 Av. Ibn Battouta Rabat Morocco LIA-CERI University of Avignon Agroparc 339 chemin des Meinajaries Avignon France National Institute of Post and Telecommunication 2 Av. Allal El Fassi Madinat Al-Irfane Rabat Morocco

ISBN: (纸本)9781467303842

Internet pricing schemes have not been concerned in the network-neutrality research. In this paper, we study the implication of non-neutrality on the competition between Internet Access Providers. We interpret non-neutral network when a service provider privileges a Content Provider (CP) in order to propose a high quality of service for this content like time-sensitive applications (voice over Internet protocol, live video streaming, online gaming). We present a competitive model that describes the interaction between several competing telecommunications Access Providers (APs), their subscribers, and a network owner. Competition between the access providers is assumed to take place in their pricing decisions as well as in terms of the Quality of Service (QoS) they offer. Furthermore, our work focuses on the analysis of games between APs under two cases: case of neutral network and case of non-neutral network. After having discussed the existence and uniqueness of equilibrium, we analyzed the impact of non-neutrality versus neutrality. In particular, we showed that non-neutrality has a significant effect on the charged tariffs and the perceived quality of services in case where exist restrictions on the available bandwidth at the AP-CP link. © 2011 INRIA.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

network and computer performance in malicious environments: The good, the bad and the ugly

Network and computer performance in malicious environments: ...

引用

international conference on network games, control and optimization, netgcoop 2011

作者： Ben-Porat, Udi Bremler-Barr, Anat Levy, Hanoch ETH Zurich Switzerland Computer Science Dpt. Interdisciplinary Center Herzliya Israel Balvatnik School of Computer Science Tel-Aviv University Tel-Aviv Israel

ISBN: (纸本)9781467303842

Performance analysis and the design of computer and networking systems have traditionally accounted for the stochastic nature of the problem addressed and been based on stochastic type analysis, mainly expected value ("the good"). In some related disciplines, mainly computer science and algorithmic design, worst-case analysis ("the bad") have been popular. In recent years we have experienced a wave of DDoS and Cyber attacks threatening the welfare of the internet. These are launched by malicious users whose only incentive is to degrade the performance of other, innocent, users. This has triggered a new direction of research aiming at evaluating system performance while accounting for the malicious behavior of the attackers ("the ugly"). The performance metrics in this case differs from both the average-case and the worst-case and can affect system design considerably. The purpose of this work is to expose and discuss this new analysis approach as well as to distinguish it from the traditional approaches. We use a wide array of cases and results derived in the literature to demonstrate how such analysis can be carried out. We further use them to show what kind of metrics can be used to evaluate the effect of malicious behavior and the resilience of the system against them. © 2011 INRIA.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Representation of finite games as network congestion games

Representation of finite games as network congestion games

引用

international conference on network games, control and optimization (netgcoop)

作者： Igal Milchtaich Department of Economics Bar-llan University Israel

Weighted network congestion games are used for modeling interactions involving finitely many non-identical users of network resources, such as road segments or communication links. In spite of their special form, these games are not fundamentally special: every finite game can be represented as a weighted network congestion game. The same is true for the class of unweighted network congestion games with player-specific costs, in which the players differ in their cost functions rather than their weights. The intersection of the two classes consists of the unweighted network congestion games. These games are special: a finite game can be represented in this form if and only if it is an exact potential game.

关键词： games Cost function network topology Joining processes Game theory Roads Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Impact of clustering on diffusions and contagions in random networks

Impact of clustering on diffusions and contagions in random ...

引用

international conference on network games, control and optimization (netgcoop)

作者： Emilie Coupechoux Marc Lelarge INRIA/ENS France

Motivated by the analysis of social networks, we study a model of network that has both a tunable degree distribution and a tunable clustering coefficient. We compute the asymptotic (as the size of the population tends to infinity) for the number of acquaintances and the clustering for this model. We analyze a contagion model with threshold effects and obtain conditions for the existence of a large cascade. We also analyze a diffusion process with a given probability of contagion. In both cases, we characterize conditions under which a global cascade is possible.

关键词： Computational modeling Probability distribution Analytical models Switches Correlation Random variables Social network services

来源：评论

学校读者我要写书评

暂无评论

network congestion control with Markovian multipath routing

Network congestion control with Markovian multipath routing

引用

international conference on network games, control and optimization (netgcoop)

作者： Roberto Cominetti Cristóbal Guzmán Departamento de Ingenieria Industrial Universidad de Chile Santiago Chile School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta GA USA

In this paper we consider an integrated model for TCP/IP protocols with multipath routing. The model combines a network Utility Maximization for rate control based on end-to-end queuing delays, with a Markovian Traffic Equilibrium for routing based on total expected delays. We prove the existence of a unique equilibrium state which is characterized as the solution of an unconstrained strictly convex program. A distributed algorithm for solving this optimization problem is proposed, with a brief discussion of how it can be implemented by adapting the current Internet protocols.

关键词： Delay Routing Mathematical model Equations Routing protocols Markov processes

来源：评论

学校读者我要写书评

暂无评论

Equilibrium selection in potential games with noisy rewards

Equilibrium selection in potential games with noisy rewards

引用

international conference on network games, control and optimization (netgcoop)

作者： David S. Leslie Jason R. Marden School of Mathematics University of Bristol UK Department of Electrical Computer and Energy Engineering University of Colorado Boulder USA

Game theoretical learning in potential games is a highly active research area stemming from the connection between potential games and distributed optimisation. In many settings an optimisation problem can be represented by a potential game where the optimal solution corresponds to the potential function maximizer. Accordingly, significant research attention has focused on the design of distributed learning algorithms that guarantee convergence to the potential maximizer in potential games. However, there are currently no existing algorithms that provide convergence to the potential function maximiser when utility functions are corrupted by noise. In this paper we rectify this issue by demonstrating that a version of payoff-based loglinear learning guarantees that the only stochastically stable states are potential function maximisers even in noisy settings.

关键词： games optimization Joints Presses Learning systems Convergence Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Lyapunov analysis of a distributed optimization scheme

Lyapunov analysis of a distributed optimization scheme

引用

international conference on network games, control and optimization (netgcoop)

作者： Karla Kvaternik Lacra Pavel Edward S. Rogers Department of Electrical and Computer Engineering University of Toronto Canada

We analyze the convergence of the distributed multi-agent optimization scheme originally proposed in [1]. In this scheme, a number of agents cooperate to estimate the minimum of the sum of their locally-known cost functions. We consider a special case for which the collective cost function is strongly convex and where the agent communication graph is fixed. Whereas the analysis in [1] focuses on the suboptimality of the Cesàro averages of the agents' sequences, we establish explicit ultimate bounds on the agents' estimation errors themselves. We demonstrate that the collective optimum is globally practically asymptotically stable for this algorithm.

关键词： Vectors Convergence Cost function Algorithm design and analysis Eigenvalues and eigenfunctions Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

Unilateral altruism in network routing games with atomic players

Unilateral altruism in network routing games with atomic pla...

引用

international conference on network games, control and optimization (netgcoop)

作者： Amar Prakash Azad John Musacchio

We study a routing game in which one of the players unilaterally acts altruistically by taking into consideration the latency cost of other players as well as his own. By not playing selfishly, a player can not only improve the other players' equilibrium utility but also improve his own equilibrium utility. To quantify the effect, we define a metric called the Value of Unilateral Altruism (VoU) to be the ratio of the equilibrium utility of the altruistic user to the equilibrium utility he would have received in Nash equilibrium if he were selfish. We show by example that the VoU, in a game with nonlinear latency functions and atomic players, can be arbitrarily large. Since the Nash equilibrium social welfare of this example is arbitrarily far from social optimum, this example also has a Price of Anarchy (PoA) that is unbounded. The example is driven by there being a small number of players since the same example with non-atomic players yields a Nash equilibrium that is fully efficient.

关键词： games Routing Nash equilibrium Elbow Cost function Delay Vectors

来源：评论

学校读者我要写书评

暂无评论

Robust planning of green wireless networks

Robust planning of green wireless networks

引用

international conference on network games, control and optimization (netgcoop)

作者： Grit Claßen Arie M.C.A. Koster Anke Schmeink Lehrstuhl II für Mathematik and UMIC Research Centre RWTH Aachen University Aachen Germany Lehrstuhl II für Mathematik RWTH Aachen University Aachen Germany UMIC Research Centre RWTH Aachen University Aachen Germany

Current methods dealing with the energy efficient wireless network planning problem require a static model. However, bit rate requirements vary and rise over time, users move around and path gain fluctuates. In this paper, robust optimization is applied to deal with demand uncertainty. We present a robust optimization model for the energy-efficient planning of wireless networks and apply cutting planes to reduce the complexity of the model. Furthermore, a case study is performed to compare the robust formulation to its deterministic counterpart and to conventional network planning.

关键词： Robustness Planning Wireless networks optimization Bandwidth Bit rate Uncertainty

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：