Titlebook: Algorithms for Sensor Systems; 13th International S Antonio Fernández Anta,Tomasz Jurdzinski,Yanyong Z Conference proceedings 2017 Springer

愛(ài)管閑事

滔滔不絕地說(shuō)

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.

后退

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.

褻瀆

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.

財(cái)主

VEN

男學(xué)院

ORBIT

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

畸形

Deceit