Titlebook: Structural Information and Communication Complexity; 15th International C Alexander A. Shvartsman,Pascal Felber Conference proceedings 2008

Juvenile

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compassesudied with theoretical concerns. This paper contributes discussion on relationship between inaccuracy of compasses which give axes of coordinate systems of robots and the possibility of gathering robots. The gathering problem is to make all robots meet at a single point which is not predefined. The

赏心悦目

Locating and Repairing Faults in a Network with Mobile Agents network may be faulty and the agents are to find the faults and repair them. The agents could be software agents, if the underlying network represents a computer network, or robots, if the underlying network represents some potentially hazardous physical terrain. Assuming that the first agent encou

宣传

entice

Condyle

Distributed Approximation Algorithm for Resource Clusteringdant tasks, where each task is to be processed on a different cluster. In this context, each cluster should be large enough so as to hold and process a task, and the maximal distance between two hosts belonging to the same cluster should be small in order to minimize latencies of intra-cluster commu

Arbitrary

中止

Discovery of Network Properties with All-Shortest-Paths Queriesy the vertex set . of the network is known. Information about the edges and non-edges of the network can be obtained by querying nodes of the network. A query at a node . ∈ . returns the union of all shortest paths from . to all other nodes in .. We study the problem as an online problem – an algori

有害

Recovering the Long-Range Links in Augmented Graphsfined by a pair (.,.), where . is a graph in which inter-node distances are supposed to be easy to compute or at least easy to estimate. This graph is ”augmented” by links, called . links, which are selected according to the probability distribution .. The augmented graph model enables the analysis

Notify

infinite