1024 search results - page 68 / 205 » The Generalized PatchMatch Correspondence Algorithm |
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
ALT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
JCO
2010
14 years 8 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract— Redundant manipulators have some advantages when compared with classical arms because they allow the trajectory optimization, both on the free space and on the presence...