General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm

Artículos similares

A nonlinear algorithm for traffic estimation with state constraints

Acceso

Mariano A. Risso, Neila Bhouri, Pablo A. Lotito, Aldo J. Rubiales Pág. 600 - 608

We present a real-time traffic state estimation algorithm for motorways. Natural constraints on the variables, like practical bounds on densities and velocities, are incorporated in the estimation process aiming to obtain better estimation results. The d... ver más

Revista: Transportation Research Procedia

Information and Phylogenetic Systematic Analysis

Acceso

Walter Craig and Jonathon Stone

Information in phylogenetic systematic analysis has been conceptualized, defined, quantified, and used differently by different authors. In this paper, we start with the Shannon Uncertainty Measure information measure I, applying it to cladograms contain... ver más

Revista: Information

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Acceso

Maurice Queyranne and Andreas S. Schulz Pág. 1241 - 1253

Revista: SIAM JOURNAL ON COMPUTING

Tight Bounds for Testing Bipartiteness in General Graphs

Acceso

Tali Kaufman, Michael Krivelevich, Dana Ron Pág. 1417 - 1440

Revista: SIAM JOURNAL ON COMPUTING

Lower Bounds on the Quantum Capacity and Highest Error Exponent of General Memoryless Channels

Acceso

Hamada, M. Pág. 2547 - 2557

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Artículos similares

Revistas destacadas