Sciweavers

5331 search results - page 463 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
AAAI
1998
15 years 8 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
TCAD
2008
97views more  TCAD 2008»
15 years 6 months ago
Encoding Large Asynchronous Controllers With ILP Techniques
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
Josep Carmona, Jordi Cortadella
SIAMMAX
2010
113views more  SIAMMAX 2010»
15 years 1 months ago
Approximate Nullspace Iterations for KKT Systems
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
Kazufumi Ito, Karl Kunisch, Volker Schulz, Ilia Gh...
UAI
1998
15 years 8 months ago
An Anytime Algorithm for Decision Making under Uncertainty
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...
Michael C. Horsch, David Poole
JC
2007
101views more  JC 2007»
15 years 6 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak