Sciweavers

909 search results - page 36 / 182
» On the approximability of some network design problems
Sort
View
EOR
2006
107views more  EOR 2006»
15 years 1 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
15 years 8 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 1 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang
CJ
2010
132views more  CJ 2010»
14 years 11 months ago
Internet Failures: an Emergent Sea of Complex Systems and Critical Design Errors?
Complex systems researchers have looked to the Internet as a possible source of interesting emergent behaviour. Indeed, some high profile failures, and some low level phenomena, m...
Jon Crowcroft
HASE
2007
IEEE
15 years 7 months ago
Design of a Fairness Guarantee Mechanism Based on Network Measurement
In this paper we discuss the problem of network fairness. Traditional network fairness focuses on treating uneven resource (such as bandwidth) allocation in TCP congestion control...
Xin Wang, Xiaochen Zhang, Shuang Yang, Xiangyang X...