1927 search results - page 124 / 386 » UMDAs for dynamic optimization problems |
109
Voted
NIPS
2001
15 years 2 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
102
click to vote
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
ISCC
2009
IEEE
15 years 7 months ago
2009
IEEE
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple ...
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
—A material handling (MH) system of a general assembly line dispatching parts from inventory to working buffers could be complicated and costly to operate. Generally it is extrem...
106
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...