Sciweavers

14739 search results - page 289 / 2948
» An optimization problem on the sphere
Sort
View
CDC
2009
IEEE
116views Control Systems» more  CDC 2009»
15 years 3 months ago
On the linear-exponential filtering problem for general Gaussian processes
The explicit solution of the filtering problem with exponential criteria for a general Gaussian signal is obtained through an approach which is based on a conditional Cameron-Mart...
Marina L. Kleptsyna, Alain Le Breton, Michel Viot
WSC
2008
15 years 1 months ago
Update on economic approach to simulation selection problems
This paper summarizes new analytical and empirical results for the economic approach to simulation selection problems that we introduced two years ago. The approach seeks to help ...
Stephen E. Chick, Noah Gans
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 22 days ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
NIPS
2004
15 years 20 days ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 20 days ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan