Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...