Sciweavers

7006 search results - page 211 / 1402
» Approximation Algorithms
Sort
View
EOR
2007
117views more  EOR 2007»
15 years 3 months ago
Simultaneous perturbation stochastic approximation of nonsmooth functions
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
Vaida Bartkute, Leonidas Sakalauskas
68
Voted
ICPR
2008
IEEE
16 years 4 months ago
Vector field resampling using local streamline approximation
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
Mani Thomas, Chandra Kambhamettu, Cathleen A. Geig...
121
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
An Exact Solution to an Approximated Model of RED
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
Claus Bauer, Homayoun Yousefi'zadeh, Hamid Jafarkh...
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
15 years 8 months ago
Competitive Online Approximation of the Optimal Search Ratio
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 10 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov