Maximum Likelihood from Incomplete Data via the EM Algorithm
6 Apr 2007 GOOD I. J. (1965) The Estimation of Probabilities: An Essay on Modern Bayesian Methods. Cambridge
Dimitri P. Bertsekas a and David A. Castanon b 1. Introduction
Assignment problem auction algorithm; synchronous and asynchronous Linear Network Optimization: Algorithms and Codes (MIT Press
A Distributed Algorithm for the Assignment Problem
This paper describes a new algorithm for solving the classical assignment in developing distributed algorithms for optimization and other problems.
Mathematical Equivalence of the Auction Algorithm for Assignment
2 Laboratory for Information and Decision Systems M.I.T
A FORWARD/REVERSE AUCTION ALGORITHM FOR
2 Department of Electrical Engineering and Computer Science M. I. T.
An Auction Algorithm for Shortest Paths
AN AUCTION ALGORITHM FOR SHORTEST PATHS*. DIMITRI P. BERTSEKAS'. Abstract. A new and simple algorithm for finding shortest paths in a directed graph is
Gaussian mixture models and the EM algorithm
Expectation-Maximization (EM) algorithm first for the specific case of GMMs
Auction Algorithms
Auction Algorithms. Dimitri P. Bertsekas bertsekas@lids.mit.edu. Laboratory for Information and Decision Systems. Massachusetts Institute of Technology.
D.P. Bertsekas 1. INTRODUf;rION Relaxation methods for optimal
The algorithm can also be inter- preted as a Jacobi -like relaxation method for solving a dual problem. Its. (sequential) worst -case complexity for a
Rollout Algorithms for Discrete Optimization: A Survey
dimitrib@mit.edu This chapter discusses rollout algorithms a sequential approach to ... A rollout algorithm starts from some given heuristic.
