Sciweavers

1290 search results - page 126 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
ATAL
2007
Springer
16 years 17 days ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
SIGIR
2008
ACM
15 years 5 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
CIKM
2005
Springer
15 years 12 months ago
Structure-based query-specific document summarization
Summarization of text documents is increasingly important with the amount of data available on the Internet. The large majority of current approaches view documents as linear sequ...
Ramakrishna Varadarajan, Vagelis Hristidis
PCI
2005
Springer
15 years 12 months ago
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
Stratis Ioannidis, Christos Nomikos, Aris Pagourtz...
ECSQARU
2003
Springer
15 years 11 months ago
Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Weiru Liu, Xin Hong, Kenneth Adamson