4841 search results - page 744 / 969 » On dynamic feature location |
AIPS
1998
13 years 10 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
MVA
2000
13 years 10 months ago
2000
work, applies a nonlinear transformation from the input space to the hidden space. The output layer Partial face images, e.g.1 eyes, nose, and ear supplies the response of the netw...
MOBICOM
2010
ACM
13 years 9 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
ADHOC
2007
13 years 9 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
CACM
2008
13 years 9 months ago
2008
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...