5316 search results - page 139 / 1064 » Which Search Problems Are Random |
143
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we study the optimal way of distributing sensors in a random field to minimize the estimation distortion. We show that this problem is equivalent to certain proble...
121
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
131
Voted
ICPP
2006
IEEE
15 years 9 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
140
click to vote
AAAI
1996
15 years 4 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
128
Voted
TREC
2007
15 years 4 months ago
2007
This paper describes several approaches which we used for the expert search task of the TREC 2007 Enterprise track. We studied several methods of relevance propagation from docume...