Sciweavers

1177 search results - page 52 / 236
» Iterative methods for Robbins problems
Sort
View
120
Voted
NIPS
2007
15 years 1 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
108
Voted
SAC
2011
ACM
14 years 7 months ago
A quasi-Newton acceleration for high-dimensional optimization algorithms
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
Hua Zhou, David Alexander, Kenneth Lange
IJCAI
2003
15 years 1 months ago
On the Revision of Probabilistic Beliefs using Uncertain Evidence
We revisit the problem of revising probabilistic beliefs using uncertain evidence, and report results on four major issues relating to this problem: How to specify uncertain evide...
Hei Chan, Adnan Darwiche
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 2 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
NMA
2010
14 years 10 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso