7129 search results - page 409 / 1426 » Approximation Algorithms for Treewidth |
143
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
134
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
149
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
142
click to vote
DCG
2008
15 years 5 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
134
click to vote
SIAMDM
2002
15 years 4 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...