Sciweavers

2566 search results - page 239 / 514
» The Online Median Problem
Sort
View
ECAL
2007
Springer
16 years 24 days ago
Near-Optimal Mobile Robot Recharging with the Rate-Maximizing Forager
We examine the practical problem of a mobile autonomous robot performing a long-duration survey task, during which it must recharge its batteries periodically. We present a scalabl...
Jens Wawerla, Richard T. Vaughan
ICWE
2005
Springer
16 years 4 days ago
Identifying Websites with Flow Simulation
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
Pierre Senellart
SIGIR
2004
ACM
16 years 2 days ago
A joint framework for collaborative and content filtering
This paper proposes a novel, unified, and systematic approach to combine collaborative and content-based filtering for ranking and user preference prediction. The framework inco...
Justin Basilico, Thomas Hofmann
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
15 years 12 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
165
Voted
ICDCSW
2002
IEEE
15 years 11 months ago
Trust-Aware Cooperation
In mobile teamwork environments two basic problems exist: how to discover someone based on a profile (skills, reputations) and how to assess that person’s “credibility” (tr...
Zoran Despotovic, Karl Aberer, Manfred Hauswirth