Lucertini, M., Y. Per1 and B. Simeone, Most uniform path partitioning and its use in image processing, Discrete Applied Mathematics 42 (1993) 227-256. Let Q be a vertex-weighted path with n vertices. For any pair (L,(i) can one find a partition of Q into (a given numberp of) subpaths, such that the total weight of every subpath lies between L and U? We present linear-time algorithms for the par...

The shortest path question is in a graph theory model question, and it is applied in many fields. The most short-path question may divide into two kinds: Single sources most short-path, all apexes to most short-path. This article mainly introduces the problem of all apexes to most short-path, and gives a new parallel algorithm of all apexes to most short-path according to the Dijkstra algorithm...

It has been recognized for some time that nonzero signal rise and fall times contribute to gate propagation delays. Practically, however, most timing analysis tools ignore these contributions when computing path delays and identifying critical paths in combinational circuits. In this paper we describe how these rise and fall times can be incorporated into path analysis algorithms. Interestingly...

One of the problems in future processors will be the resource conflicts caused by several load/store units competing to access the same cache bank. The traditional approach for handling this case is by introducing buffers combined with a cross-bar. This approach suffers from (i) the nondeterministic latency of a load/store and (ii) the extra latency caused by the cross-bar and the buffer manage...

Method for robust schedule preparation for domain of profit based cooperation is introduced in this paper. The method aims schedules, which are prepared and concluded step-by-step during the team formation phase. The method takes into account domain specifics, like incomplete information about the partners, and their various reputation and skill levels. The method is based on critical path disp...