1486 search results - page 105 / 298 » Algorithms for two-box covering |
130
click to vote
SECON
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
160
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
140
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Organizing Web search results into a hierarchy of topics and subtopics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierar...
154
Voted
IJCAI
2001
15 years 5 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
138
click to vote
COR
2007
15 years 3 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...