Sciweavers

451 search results - page 11 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
14 years 11 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
NIPS
2004
14 years 11 months ago
The Convergence of Contrastive Divergences
This paper analyses the Contrastive Divergence algorithm for learning statistical parameters. We relate the algorithm to the stochastic approximation literature. This enables us t...
Alan L. Yuille
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
14 years 4 months ago
Hybrid moment computation algorithm for biochemical reaction networks
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
Yun-Bo Zhao, Jongrae Kim, João Pedro Hespan...
INFOCOM
1998
IEEE
15 years 1 months ago
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
Santosh Paul Abraham, Anurag Kumar
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
14 years 11 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál