3341 search results - page 644 / 669 » On Bounded Queries and Approximation |
132
Voted
PDCN
2004
15 years 2 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
108
Voted
NIPS
1998
15 years 2 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
116
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
110
Voted
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
112
Voted
AI
2007
Springer
15 years 28 days ago
2007
Springer
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...