5316 search results - page 220 / 1064 » Which Search Problems Are Random |
123
click to vote
CI
1998
15 years 3 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
159
click to vote
EWSN
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
128
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
114
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
152
click to vote
AAAI
1998
15 years 5 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...