1277 search results - page 214 / 256 » Terminating Decision Algorithms Optimally |
127
Voted
MP
2006
15 years 3 months ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
140
Voted
TIP
2008
15 years 3 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
149
Voted
APPROX
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
141
click to vote
ICTAI
2009
IEEE
15 years 1 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
140
Voted
ECAI
2010
Springer
15 years 28 days ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...