3874 search results - page 343 / 775 » Approximation Algorithms for k-hurdle Problems |
195
click to vote
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
134
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
159
click to vote
ADAEUROPE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
124
click to vote
JFPLC
2003
15 years 6 months ago
2003
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
149
click to vote
JAIR
2011
14 years 8 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...