Sciweavers

81 search results - page 7 / 17
» On the probabilistic complexity of finding an approximate so...
Sort
View
ENDM
2010
136views more  ENDM 2010»
13 years 7 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 2 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
PVLDB
2010
252views more  PVLDB 2010»
13 years 2 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
JAIR
2010
115views more  JAIR 2010»
13 years 5 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
INFOCOM
2009
IEEE
14 years 2 months ago
Diverse Routing in Networks with Probabilistic Failures
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
Hyang-Won Lee, Eytan Modiano