爱管闲事
发表于 2025-3-30 10:31:21
http://reply.papertrans.cn/16/1533/153246/153246_51.png
滔滔不绝地说
发表于 2025-3-30 14:23:45
Improved Leader Election for Self-organizing Programmable Matter,rithm which solves the leader election problem in . asynchronous rounds with high probability, where . is the number of particles in the system. Our algorithm relies only on local information — particles do not have unique identifiers, any knowledge of ., or any sort of global coordinate system — and requires only constant memory per particle.
后退
发表于 2025-3-30 18:48:46
Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3,edule, depending on .. We conducted a priori and a posteriori analysis of the accuracy of this algorithm for various . comparing either with the optimal length of the schedule, or with a lower bound, the value of which we improved.
亵渎
发表于 2025-3-30 21:29:52
A Continuous Strategy for Collisionless Gathering, this class. Our second result is about collisions in such strategies. We present a contracting strategy which ensures that no collisions occur. This strategy needs the robots to have some additional capabilities.
财主
发表于 2025-3-31 02:46:38
http://reply.papertrans.cn/16/1533/153246/153246_55.png
VEN
发表于 2025-3-31 08:38:08
http://reply.papertrans.cn/16/1533/153246/153246_56.png
男学院
发表于 2025-3-31 12:47:01
http://reply.papertrans.cn/16/1533/153246/153246_57.png
ORBIT
发表于 2025-3-31 16:25:37
Zur Theorie politischer Karrieren,n edge-weighted .-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. We provide an algorithm that works in polynomial time if one can find a set of obligatory edges that yie
畸形
发表于 2025-3-31 18:29:23
http://reply.papertrans.cn/16/1533/153246/153246_59.png
Deceit
发表于 2025-3-31 21:52:18
http://reply.papertrans.cn/16/1533/153246/153246_60.png