752 search results - page 68 / 151 » Faster approximation algorithms for the minimum latency prob... |
123
click to vote
SARA
2007
Springer
15 years 9 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
138
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
124
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
126
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
110
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...