Sciweavers

239 search results - page 13 / 48
» Random walks in a supply network
Sort
View
ORL
2006
105views more  ORL 2006»
13 years 8 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
INFOCOM
2010
IEEE
13 years 7 months ago
Cognitive Mobile Virtual Network Operator: Investment and Pricing with Supply Uncertainty
Abstract—This paper presents the first analytical study of optimal investment and pricing decisions of a cognitive mobile virtual network operator (C-MVNO) under spectrum supply...
Lingjie Duan, Jianwei Huang, Biying Shou
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 10 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 8 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
INFOCOM
2009
IEEE
14 years 3 months ago
Budget-Based Self-Optimized Incentive Search in Unstructured P2P Networks
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
Yi Hu, Min Feng, Laxmi N. Bhuyan, Vana Kalogeraki