Sciweavers

4100 search results - page 204 / 820
» General Linear Cameras
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 4 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
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
AMAI
2006
Springer
15 years 4 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
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...
Dmitri A. Dolgov, Edmund H. Durfee
HEURISTICS
2008
120views more  HEURISTICS 2008»
15 years 4 months ago
A local linear embedding module for evolutionary computation optimization
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...
Fabio Boschetti
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 4 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
JMLR
2006
125views more  JMLR 2006»
15 years 4 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
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...
Chen Yanover, Talya Meltzer, Yair Weiss