Sciweavers

2862 search results - page 29 / 573
» Bicriteria Network Design Problems
Sort
View
ALGOSENSORS
2009
Springer
14 years 4 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
EOR
2006
107views more  EOR 2006»
13 years 9 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»
14 years 4 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
MOBICOM
2009
ACM
14 years 4 months ago
Neighbor discovery in wireless networks and the coupon collector's problem
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
Sudarshan Vasudevan, Donald F. Towsley, Dennis Goe...
DM
2002
100views more  DM 2002»
13 years 9 months ago
A branch-and-cut approach for minimum cost multi-level network design
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...
Sunil Chopra, Chih-Yang Tsai