Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
This paper addresses fault-tolerant topology control in a heterogeneous wireless sensor network consisting of several resource-rich supernodes, used for data relaying, and a large...
Temporal restoration of image sequences may fail because of erroneously estimated motion. Motion estimation failures may occur for several reasons: complicated motion, severe arte...
Andrei Rares, Marcel J. T. Reinders, Reginald L. L...
— The flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper,...