3049 search results - page 57 / 610 » On the Convergence of Bound Optimization Algorithms |
139
click to vote
NIPS
1998
15 years 5 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
147
click to vote
AE
2005
Springer
15 years 9 months ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
122
click to vote
NIPS
2008
15 years 5 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
130
click to vote
ICML
1995
IEEE
16 years 5 months ago
1995
IEEE
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...