Sciweavers

3708 search results - page 381 / 742
» The Inverse Classification Problem
Sort
View
SODA
2004
ACM
156views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
Yuval Emek, David Peleg
SIAMCO
2008
81views more  SIAMCO 2008»
15 years 6 months ago
Connections between Singular Control and Optimal Switching
This paper builds a new theoretical connection between singular control of finite variation and optimal switching problems. This correspondence provides a novel method for solving ...
Xin Guo, Pascal Tomecek
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
15 years 6 months ago
Hybrid state estimation: a target tracking application
In this paper we present a framework in which the general hybrid filtering or state estimation problem can be formulated. The problem of joint tracking and classification can be f...
Yvo Boers, Hans Driessen
CCE
2004
15 years 6 months ago
Retrospective on optimization
In this paper we provide a general classification of mathematical optimization problems, followed by a matrix of applications that shows the areas in which these problems have bee...
Lorenz T. Biegler, Ignacio E. Grossmann
SIAMJO
2002
124views more  SIAMJO 2002»
15 years 6 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...