hierarchy
发表于 2025-3-21 18:45:41
书目名称Structural Information and Communication Complexity影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0879966<br><br> <br><br>书目名称Structural Information and Communication Complexity读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0879966<br><br> <br><br>
盖他为秘密
发表于 2025-3-21 23:24:36
Tracking Routes in Communication Networks prove that the problem remains NP-hard even for cubic planar graphs and all pairs ., where . and . are the sets of sources and destinations, respectively. Finally, for the case of a single source-destination pair, we design an (exact) FPT algorithm w.r.t. the maximum number of vertices at the same
faucet
发表于 2025-3-22 00:37:41
http://reply.papertrans.cn/88/8800/879966/879966_3.png
Vertebra
发表于 2025-3-22 04:50:50
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights coordinate axes) and . (they agree on the direction and orientation of only one coordinate axis). In both settings, we have provided a full characterization of initial configurations from where any arbitrary pattern can be formed.
Externalize
发表于 2025-3-22 10:28:46
http://reply.papertrans.cn/88/8800/879966/879966_5.png
虚度
发表于 2025-3-22 13:47:10
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agentsd (as the original problem). We consider the optimization version of the problem that asks for the optimal energy budget . per agent which allows for a feasible delivery schedule, given the initial positions of the agents. We show the existence of better approximations for the fixed-path version of
雪上轻舟飞过
发表于 2025-3-22 17:25:47
Asynchronous Rendezvous with Different Mapse rendezvous problem does not have a feasible solution. In this paper, while we keep the containment assumption, we focus on asynchronous robots and the relevant bounds in the four considered variants. We provide some impossibility results and almost tight lower and upper bounds when the solutions a
Nebulous
发表于 2025-3-23 00:27:34
http://reply.papertrans.cn/88/8800/879966/879966_8.png
aerobic
发表于 2025-3-23 01:46:24
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Modelin, we study the problem of minimizing the total energy consumption of the robots. We prove that the problem is solvable only for .. For the case ., we give an optimal algorithm, and give upper bounds on the energy for the case ...We also consider the problem of minimizing the evacuation time when t
推延
发表于 2025-3-23 07:36:03
Distributed Pattern Formation in a Ringy block, our algorithm requires . steps, and is asymptotically optimal. Our algorithm generalizes for an arbitrary number of colours, and terminates in .(.) steps. We also show how to extend it to achieve arbitrary specific final patterns, provided there is at least one agent of every colour in ever