Sciweavers

3367 search results - page 331 / 674
» Incremental assignment problem
Sort
View
EOR
2007
79views more  EOR 2007»
15 years 4 months ago
The directional p
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...
JSAC
2007
109views more  JSAC 2007»
15 years 4 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— 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...
ICTAI
2009
IEEE
15 years 2 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
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...
Cédric Pinto, Cyril Terrioux
ICCAD
2008
IEEE
130views Hardware» more  ICCAD 2008»
15 years 11 months ago
Area-I/O flip-chip routing for chip-package co-design
— 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...
Jia-Wei Fang, Yao-Wen Chang
MOBICOM
2006
ACM
15 years 10 months ago
Distributed channel management in uncoordinated wireless environments
Wireless 802.11 hotspots have grown in an uncoordinated fashion with highly variable deployment densities. Such uncoordinated deployments, coupled with the difficulty of implemen...
Arunesh Mishra, Vivek Shrivastava, Dheeraj Agrawal...