Sciweavers

5316 search results - page 901 / 1064
» Which Search Problems Are Random
Sort
View
INFOCOM
2002
IEEE
15 years 9 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
ATAL
2010
Springer
15 years 4 months ago
Incremental plan aggregation for generating policies in MDPs
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
Florent Teichteil-Königsbuch, Ugur Kuter, Gui...
138
Voted
WWW
2009
ACM
16 years 5 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
WWW
2005
ACM
16 years 5 months ago
Disambiguating Web appearances of people in a social network
Say you are looking for information about a particular person. A search engine returns many pages for that person's name but which pages are about the person you care about, ...
Ron Bekkerman, Andrew McCallum
WWW
2005
ACM
16 years 5 months ago
Algorithmic detection of semantic similarity
Automatic extraction of semantic information from text and links in Web pages is key to improving the quality of search results. However, the assessment of automatic semantic meas...
Ana Gabriela Maguitman, Filippo Menczer, Heather R...