Sciweavers

3049 search results - page 525 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
MP
2007
95views more  MP 2007»
13 years 8 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
MFCS
2010
Springer
13 years 7 months ago
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
Gero Greiner, Riko Jacob
FLAIRS
2009
13 years 6 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
GI
2009
Springer
13 years 6 months ago
Constraint-Based Task Scheduling with Sequence Dependent Setup Times, Time Windows and Breaks
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
Armin Wolf
ICASSP
2011
IEEE
13 years 17 days ago
Bound-ratio minimization of filter bank frames by periodic precoding
Frame (upper and lower) bound ratio is a key factor of numerical stability of frame systems. While tight frames, of which the minimal ratio 1 is achieved, are much preferred in ma...
Li Chai, Jingxin Zhang