— A fundamental goal of a wireless sensor network (WSN) is to collect and deliver data to external applications. Due to the strong constraints of these networks, routing algorith...
Carlos Mauricio S. Figueiredo, Eduardo Freire Naka...
- In this paper, we propose an optimal fault tolerant broadcasting algorithm which requires only n+1 steps for an SIMD hypercube with up to n-1 faulty nodes. The basic idea of the ...
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...