Sciweavers

489 search results - page 33 / 98
» Formulations and Reformulations in Integer Programming
Sort
View
ICCD
2008
IEEE
175views Hardware» more  ICCD 2008»
14 years 4 months ago
Contention-aware application mapping for Network-on-Chip communication architectures
- In this paper, we analyze the impact of network contention on the application mapping for tile-based Networkon-Chip (NoC) architectures. Our main theoretical contribution consist...
Chen-Ling Chou, Radu Marculescu
CISS
2007
IEEE
13 years 11 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu
TCS
2010
13 years 6 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
ICASSP
2010
IEEE
13 years 8 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
INFOCOM
2000
IEEE
13 years 11 months ago
Traffic Engineering Using Multiple Multipoint-to-Point LSPs
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
Hiroyuki Saito, Yasuhiro Miyao, Makiko Yoshida