2714 search results - page 479 / 543 » On the Notion of Value Object |
116
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
226
click to vote
OL
2011
14 years 7 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
128
Voted
WWW
2011
ACM
14 years 7 months ago
2011
ACM
Most product search engines today build on models of relevance devised for information retrieval. However, the decision mechanism that underlies the process of buying a product is...
103
Voted
JGO
2010
14 years 7 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
116
click to vote
JMLR
2010
14 years 7 months ago
2010
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...