1405 search results - page 25 / 281 » Popularity at Minimum Cost |
FMCAD
2007
Springer
14 years 1 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
EOR
2006
13 years 7 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...