982 search results - page 163 / 197 » Solving Steiner tree problems in graphs to optimality |
DAC
1995
ACM
15 years 4 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
87
Voted
APPML
2007
15 years 18 days ago
2007
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
112
click to vote
ALGORITHMICA
2002
15 years 10 days ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
102
click to vote
SYNASC
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
110
click to vote
PAMI
2007
14 years 12 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...