Sciweavers

664 search results - page 18 / 133
» Some results for a class of generalized polynomials
Sort
View
EOR
2008
69views more  EOR 2008»
13 years 11 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi
JC
2008
128views more  JC 2008»
13 years 10 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
JAIR
2006
87views more  JAIR 2006»
13 years 10 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
GLOBECOM
2009
IEEE
14 years 5 months ago
Feasibility Conditions for Interference Alignment
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
Cenk M. Yetis, Tiangao Gou, Syed Ali Jafar, Ahmet ...
HYBRID
2005
Springer
14 years 4 months ago
Polynomial Stochastic Hybrid Systems
This paper deals with polynomial stochastic hybrid systems (pSHSs), which generally correspond to stochastic hybrid systems with polynomial continuous vector fields, reset maps, a...
João P. Hespanha