914 search results - page 167 / 183 » The Computational Complexity of Probabilistic Planning |
GI
2009
Springer
13 years 6 months ago
2009
Springer
: When a tactical aircraft sets out on a mission in dense airborne and surface RF (radio frequency) emitter environment, the pilot desires to minimize the use of the onboard fire c...
IPSN
2007
Springer
14 years 3 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
ICPP
2006
IEEE
14 years 2 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
TCSV
2011
13 years 3 months ago
2011
—We present in this paper an integrated solution to rapidly recognizing dynamic objects in surveillance videos by exploring various contextual information. This solution consists...