6315 search results - page 152 / 1263 » Approximating Solution Structure |
158
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
158
click to vote
AAAI
2004
15 years 7 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
167
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
137
click to vote
ICASSP
2008
IEEE
16 years 27 days ago
2008
IEEE
In this paper, we present a novel framework for resampling and complexity reduction of tapped delay line channel models. In contrast to related algorithms in this field, our fram...
143
click to vote
ICRA
2006
IEEE
16 years 14 days ago
2006
IEEE
– The paper deals with fitting of planar patches to 3D laser range data obtained by a mobile robot. The number and the initial position of the patches are unknown, hence their es...