5316 search results - page 250 / 1064 » Which Search Problems Are Random |
158
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
120
Voted
ICRA
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— This paper presents the search problem formulated as a decision problem, where the searcher decides whether the target is present in the search region, and if so, where...
150
click to vote
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
133
click to vote
RTSS
1999
IEEE
15 years 9 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
156
click to vote
AIPS
2006
15 years 6 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...