Lower and upper bounds are proved for the time complexity of solving two decision problems in a distributed network in the presence of process failures and inexact information about time. It is assumed that the amount of (real) time between two consecutive steps of a nonfaulty process is at least c1 and at most c2; thus, C = c2=c1 is a measure of the timing uncertainty. It is also assumed that ...

One of the challenges in reliable multicast is approximating or replicating TCP’s congestion control algorithm. This has led to various proposals to adapt TCP itself for use over multicast. The drawback of these multicast TCP services is that they place significant processing load on the sender and they fail to deal with the problem of ACK implosion. This paper shows how concast, a network-laye...

Table 1: Scaled Cost values (10 5) of best k-way partitions obtained using d-dimensional embed-dings, 1 d 10. Results for KP and EIG1 are quoted from 4], and results for KC are quoted from 2]. References 1] C. for uniformly random pointsets, illustrating the exi-bility of the DP-RP approach 1].] Figure 5 describes Cluster Costs for f corresponding to Scaled Cost; the procedure returns all clust...

Maximum intersection of spherical polygons and work-piece orientation for 4-and 5-axis machining, " of convex objects in two and three dimensions , " Accessibility analysis for the automatic inspec-29-fixed. Furthermore, only one point will have an integral x-coordinate and thus achieve the maximum aperture angle by the construction of Q. The adversary will ensure that this point is fixed only ...

We have demonstrated that a self-timed on-chip cache can be produced and readily interfaced to an asynchronous microprocessor. In some parts of the design the asynchro-nous style provides a distinct advantage over a conventional , synchronous approach. An example of this is the mechanism used to reduce power consumption by switching off the RAM sense amplifiers when they are known to have produ...

We study the problem of multiple target tracking using multiple mobile robots. Our approach is to divide the cooperative multi-target tracking problem into two sub-problems: target tracking using a single mobile robot and on-line motion strategy design for multi-robot coordination. For single robot-based tracking, we address two key challenges: how to separate the egomotion of the robot from th...