Negate 发表于 2025-3-21 18:21:51

书目名称Structural Information and Communication Complexity影响因子(影响力)<br>        http://impactfactor.cn/if/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity影响因子(影响力)学科排名<br>        http://impactfactor.cn/ifr/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity网络公开度<br>        http://impactfactor.cn/at/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity网络公开度学科排名<br>        http://impactfactor.cn/atr/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity被引频次<br>        http://impactfactor.cn/tc/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity被引频次学科排名<br>        http://impactfactor.cn/tcr/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity年度引用<br>        http://impactfactor.cn/ii/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity年度引用学科排名<br>        http://impactfactor.cn/iir/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity读者反馈<br>        http://impactfactor.cn/5y/?ISSN=BK0879954<br><br>        <br><br>书目名称Structural Information and Communication Complexity读者反馈学科排名<br>        http://impactfactor.cn/5yr/?ISSN=BK0879954<br><br>        <br><br>

竞选运动 发表于 2025-3-21 21:31:14

http://reply.papertrans.cn/88/8800/879954/879954_2.png

享乐主义者 发表于 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

Outshine 发表于 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

http://reply.papertrans.cn/88/8800/879954/879954_7.png

休息 发表于 2025-3-23 00:04:08

http://reply.papertrans.cn/88/8800/879954/879954_8.png

Gleason-score 发表于 2025-3-23 04:20:56

http://reply.papertrans.cn/88/8800/879954/879954_9.png

侧面左右 发表于 2025-3-23 07:18:35

http://reply.papertrans.cn/88/8800/879954/879954_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Structural Information and Communication Complexity; 20th International C Thomas Moscibroda,Adele A. Rescigno Conference proceedings 2013 S