Sciweavers

697 search results - page 88 / 140
» Convex Functions on Discrete Sets
Sort
View
MP
1998
109views more  MP 1998»
13 years 8 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
INFORMS
2008
62views more  INFORMS 2008»
13 years 8 months ago
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Huseyin Topaloglu
INFOCOM
2003
IEEE
14 years 2 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
HYBRID
2003
Springer
14 years 1 months ago
Approximate Stabilisation of Uncertain Hybrid Systems
Abstract−Stabilization of uncertain hybrid systems with controllable transitions is considered. Uncertainty enters in the form of a disturbance input that can affect both the co...
Yan Gao, John Lygeros, Marc Quincampoix, Nicolas S...
IJCV
2006
79views more  IJCV 2006»
13 years 8 months ago
Splines in Higher Order TV Regularization
Splines play an important role as solutions of various interpolation and approximation problems that minimize special functionals in some smoothness spaces. In this paper, we show ...
Gabriele Steidl, Stephan Didas, Julia Neumann