Sciweavers

231 search results - page 24 / 47
» Stochastic Optimization is (Almost) as easy as Deterministic...
Sort
View
DLT
2009
13 years 5 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
11 years 10 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
WSC
2001
13 years 9 months ago
Stochastic modeling of airlift operations
Large-scale military deployments require transporting equipment and personnel over long distances in a short time. Planning an efficient airlift system is complicated and several ...
Julien Granger, Ananth Krishnamurthy, Stephen M. R...
KDD
2010
ACM
287views Data Mining» more  KDD 2010»
13 years 9 months ago
Designing efficient cascaded classifiers: tradeoff between accuracy and cost
We propose a method to train a cascade of classifiers by simultaneously optimizing all its stages. The approach relies on the idea of optimizing soft cascades. In particular, inst...
Vikas C. Raykar, Balaji Krishnapuram, Shipeng Yu