Sciweavers

1177 search results - page 28 / 236
» Iterative methods for Robbins problems
Sort
View
111
Voted
PE
2010
Springer
102views Optimization» more  PE 2010»
14 years 10 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
EOR
2007
90views more  EOR 2007»
15 years 8 days ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...
FS
2006
84views more  FS 2006»
15 years 10 days ago
Iterative construction of the optimal Bermudan stopping time
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
Anastasia Kolodko, John Schoenmakers
PLILP
1993
Springer
15 years 4 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
EUROCAST
2005
Springer
86views Hardware» more  EUROCAST 2005»
15 years 5 months ago
Convergence of Iterations
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
Paul Cull