Sciweavers

5075 search results - page 191 / 1015
» Convergence
Sort
View
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
15 years 4 months ago
An Agent-Based Best Effort Routing Technique for Load Balancing
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...
Sunilkumar S. Manvi, Pallapa Venkataram
ECCC
2007
180views more  ECCC 2007»
15 years 4 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
EOR
2007
117views more  EOR 2007»
15 years 4 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
SIAMDM
2008
99views more  SIAMDM 2008»
15 years 4 months ago
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
SIAMJO
2008
114views more  SIAMJO 2008»
15 years 4 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal