154 search results - page 4 / 31 » Anytime search in dynamic graphs |
CISIS
2009
IEEE
14 years 3 months ago
2009
IEEE
Pervasive computing, the new computing paradigm aiming at providing services anywhere at anytime, poses great challenges on dynamic service composition. Existing service compositi...
CEC
2010
IEEE
13 years 8 days ago
2010
IEEE
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...