Titlebook: Structural Information and Communication Complexity; 14th International C Giuseppe Prencipe,Shmuel Zaks Conference proceedings 2007 Springe

necrosis

書目名稱Structural Information and Communication Complexity影響因子(影響力)




書目名稱Structural Information and Communication Complexity影響因子(影響力)學科排名




書目名稱Structural Information and Communication Complexity網(wǎng)絡公開度




書目名稱Structural Information and Communication Complexity網(wǎng)絡公開度學科排名




書目名稱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讀者反饋學科排名

Congestion

分開如此和諧

Why Robots Need Maps, we prove the lower bound of .(log. /loglog.) for competitive ratio of any deterministic algorithm (using global communication). This significantly improves the best known constant lower bound. For the cost being the maximal number of edges traversed by a robot (the energy) we present an improved (4???2/.)-competitive online algorithm for trees.

CRAFT

A New Self-stabilizing Maximal Matching Algorithmon, the algorithm improves the previous best moves complexities for the distributed adversarial daemon from .(..) and .(.) to .(.) where n is the number of processes, m is the number of edges, and . is the maximum degree in the graph.

新陳代謝

Ischemic-Stroke

itinerary

Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robotsext, the role of common orientation shared by the robots is examined. Necessary and sufficient conditions for the partitioning problem to be solvable are given in the different timing models. Finally, the problem is proved to be unsolvable in the no-compass asynchronous model.

Asymptomatic

Incise

Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)he primal-dual schema. The kind of problems we have in mind are of the following type. We have a synchronous, message-passing network that is to compute a global function of its own topology. Examples of such functions are maximal independent sets, vertex and edge colorings, small dominating sets, v

切碎

Time Optimal Gathering in Sensor Networksthroughout the network must be collected at a sink node; the aim is to minimize the time needed to complete the process. The emphasis is on some algorithmic and graph theoretical problems arising in the area.