1277 search results - page 12 / 256 » Terminating Decision Algorithms Optimally |
ALDT
2009
Springer
15 years 4 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...
IPL
2010
14 years 8 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
80
Voted
ISIPTA
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper discusses decision making in the practically important situation where only partial prior information on the stochastic behavior of the states of nature expressed by im...
90
Voted
LION
2010
Springer
15 years 28 days ago
2010
Springer
The interactive decision making (IDM) methods exploit the preference information from the decision maker during the optimization task to guide the search towards favourite solution...
CADE
2002
Springer
15 years 9 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...