2746 search results - page 242 / 550 » Bisubmodular Function Minimization |
133
click to vote
CSREAESA
2003
15 years 5 months ago
2003
In this paper we address the problem of minimization of power consumption in combinational circuits by minimizing the number of switching transitions at the output nodes of each g...
139
click to vote
TCS
2008
15 years 4 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
149
click to vote
COR
1999
15 years 4 months ago
1999
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
133
click to vote
ARCS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
122
click to vote
BMVC
2001
15 years 6 months ago
2001
This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...