Sciweavers

505 search results - page 54 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
COR
2006
95views more  COR 2006»
14 years 12 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
TVCG
2011
120views more  TVCG 2011»
14 years 6 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
CORR
2008
Springer
99views Education» more  CORR 2008»
14 years 11 months ago
An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO Networks
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
WOWMOM
2005
ACM
82views Multimedia» more  WOWMOM 2005»
15 years 5 months ago
Power Control is not Required for Wireless Networks in the Linear Regime
— We consider the design of optimal strategies for joint power adaptation, rate adaptation and scheduling in a multi-hop wireless network. Most existing strategies control either...
Bozidar Radunovic, Jean-Yves Le Boudec
CORR
2007
Springer
151views Education» more  CORR 2007»
14 years 11 months ago
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
—In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmi...
Rui Zhang, Ying-Chang Liang