找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Structural Information and Communication Complexity; 20th International C Thomas Moscibroda,Adele A. Rescigno Conference proceedings 2013 S

[复制链接]
查看: 23576|回复: 62
发表于 2025-3-21 18:21:51 | 显示全部楼层 |阅读模式
书目名称Structural Information and Communication Complexity
副标题20th International C
编辑Thomas Moscibroda,Adele A. Rescigno
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Structural Information and Communication Complexity; 20th International C Thomas Moscibroda,Adele A. Rescigno Conference proceedings 2013 S
描述This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, held in Ischia, Italy, in July 2013. The 28 revised full papers presented were carefully reviewed and selected from 67 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks.
出版日期Conference proceedings 2013
关键词asynchronous system; distributed algorithms; graph algorithm; self-organization; wireless networks; algor
版次1
doihttps://doi.org/10.1007/978-3-319-03578-9
isbn_softcover978-3-319-03577-2
isbn_ebook978-3-319-03578-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2013
The information of publication is updating

书目名称Structural Information and Communication Complexity影响因子(影响力)




书目名称Structural Information and Communication Complexity影响因子(影响力)学科排名




书目名称Structural Information and Communication Complexity网络公开度




书目名称Structural Information and Communication Complexity网络公开度学科排名




书目名称Structural Information and Communication Complexity被引频次




书目名称Structural Information and Communication Complexity被引频次学科排名




书目名称Structural Information and Communication Complexity年度引用




书目名称Structural Information and Communication Complexity年度引用学科排名




书目名称Structural Information and Communication Complexity读者反馈




书目名称Structural Information and Communication Complexity读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:31:14 | 显示全部楼层
发表于 2025-3-22 00:45:32 | 显示全部楼层
Self-adjusting Grid Networks to Minimize Expected Path Lengthlem. In particular, we consider grid networks in which the distribution of requests is a symmetric product distribution. In this setting, we show that a simple greedy policy of position switching between neighboring nodes to locally minimize an objective function, achieves good approximation ratios.
发表于 2025-3-22 05:57:55 | 显示全部楼层
On Advice Complexity of the ,-server Problem under Sparse Metrics2-server problem on a path metric of size . ≥ 5. Through another lower bound argument, we show that at least . bits of advice is required to obtain an optimal solution for metric spaces of treewidth ., where 4 ≤ . < 2..
发表于 2025-3-22 12:28:40 | 显示全部楼层
Connected Surveillance Game > sn(.) + 1. Moreover, we prove that . for any .-node graph .. While the gap between these bounds remains huge, it seems difficult to reduce it. We then define the . where the observer has no . knowledge of the graph topology and discovers it little-by-little. Unfortunately, we show that no algorit
发表于 2025-3-22 16:18:11 | 显示全部楼层
Self-organizing Flows in Social Networkstrast, for the more realistic case of heterogeneous interests, selfish dynamics may lead to information dissemination that can be arbitrarily inefficient, as captured by an unbounded “price of anarchy”..Nevertheless the situation differs when user interests exhibit a particular structure, captured b
发表于 2025-3-22 18:51:45 | 显示全部楼层
发表于 2025-3-23 00:04:08 | 显示全部楼层
发表于 2025-3-23 04:20:56 | 显示全部楼层
发表于 2025-3-23 07:18:35 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 10:25
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表