Sciweavers

36 search results - page 3 / 8
» Recent Advances in Bound Constrained Optimization
Sort
View
ECAI
2006
Springer
13 years 10 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
ICPR
2008
IEEE
14 years 7 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 1 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 6 months ago
Slow Adaptive OFDMA Systems Through Chance Constrained Programming
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
William Weiliang Li, Ying Jun Zhang, Anthony Man-C...
JSAC
2008
161views more  JSAC 2008»
13 years 6 months ago
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management
Abstract--Radio spectrum resource is of fundamental importance for wireless communication. Recent reports show that most available spectrum has been allocated. While some of the sp...
Juncheng Jia, Qian Zhang, Xuemin Shen