4843 search results - page 251 / 969 » The Shortcut Problem - Complexity and Approximation |
137
Voted
SIAMDM
2000
15 years 3 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
116
click to vote
QUESTA
2007
15 years 3 months ago
2007
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
147
Voted
INFORMS
2010
15 years 2 months ago
2010
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should ...
99
Voted
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
122
Voted
SIAMNUM
2010
14 years 10 months ago
2010
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...