11740 search results - page 322 / 2348 » More Problems in Rewriting |
177
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We describe parallel methods for solving large-scale, high-dimensional, sparse least-squares problems that arise in machine learning applications such as document classificatio...
197
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
151
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
187
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
176
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Optimal control and estimation are dual in the LQG setting, as Kalman discovered, however this duality has proven difficult to extend beyond LQG. Here we obtain a more natural...