Sciweavers

1589 search results - page 181 / 318
» Constraints with Variables' Annotations
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Quantization with an adjustable codeword length penalty
Quantizers are generally designed either for fixed-rate coding or variable-rate coding. Under common conditions, variable-rate quantization leads to the same mean distortion for ...
W. Bastiaan Kleijn, Moo Young Kim
OL
2011
177views Neural Networks» more  OL 2011»
14 years 9 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
BIRTHDAY
2009
Springer
16 years 1 months ago
No i-Sums for Nissim (and Shalom)
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
Itamar Francez
IROS
2009
IEEE
128views Robotics» more  IROS 2009»
16 years 29 days ago
Predictive constrained gain scheduling for UGV path tracking in a networked control system
– This paper presents a predictive gain scheduler for path tracking control in a networked control system with variable delay. The controller uses the plant model to predict futu...
Bryan R. Klingenberg, Unnati Ojha, Mo-Yuen Chow
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 28 days ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...