1453 search results - page 65 / 291 » A globally optimal algorithm for TTD-MDPs |
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information o...
EAAI
2008
13 years 7 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...