Sciweavers

1974 search results - page 158 / 395
» On Unbiased Linear Approximations
Sort
View
DISOPT
2008
85views more  DISOPT 2008»
15 years 7 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci
164
Voted
MCS
2007
Springer
15 years 7 months ago
Stability of plane waves on deep water with dissipation
The Benjamin-Feir modulational instability effects the evolution of perturbed planewave solutions of the cubic nonlinear Schr¨odinger equation (NLS), the modified NLS, and the ...
Nathan E. Canney, John D. Carter
DC
2011
14 years 6 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
PODC
2009
ACM
16 years 7 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 1 months ago
Reduced-Complexity Cluster Modelling for the 3GPP Channel Model
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
Hui Xiao, Alister G. Burr, Rodrigo C. de Lamare