An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
Laura E. Jackson, George N. Rouskas, Matthias F. M...
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
— The area-I/O flip-chip package provides a high chip-density solution to the demand of more I/O’s in VLSI designs; it can achieve smaller package size, shorter wirelength, an...
Wireless 802.11 hotspots have grown in an uncoordinated fashion with highly variable deployment densities. Such uncoordinated deployments, coupled with the difficulty of implemen...