3455 search results - page 576 / 691 » Generalized Game Trees |
143
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
136
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
146
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
143
click to vote
WEBI
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
141
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Eye tracking experiments have shown that titles of Web search results play a crucial role in guiding a user’s search process. We present a machine-learned algorithm that trains ...