Sciweavers

1405 search results - page 2 / 281
» Popularity at Minimum Cost
Sort
View
ISPAN
2005
IEEE
13 years 10 months ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
IFIPTM
2010
113views Management» more  IFIPTM 2010»
13 years 3 months ago
Impact of Trust Management and Information Sharing to Adversarial Cost in Ranking Systems
Ranking systems such as those in product review sites and recommender systems usually use ratings to rank favorite items based on both their quality and popularity. Since higher ra...
Le-Hung Vu, Thanasis G. Papaioannou, Karl Aberer
INFOCOM
2007
IEEE
13 years 11 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
TON
2010
221views more  TON 2010»
12 years 12 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
NETWORKS
2010
13 years 3 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller