1486 search results - page 199 / 298 » Algorithms for two-box covering |
134
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
132
click to vote
WEBI
2004
Springer
15 years 10 months ago
2004
Springer
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
165
click to vote
WSNA
2003
ACM
15 years 9 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
129
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
133
click to vote
IPSN
2003
Springer
15 years 9 months ago
2003
Springer
We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant moti...