698 search results - page 5 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
AMAI
2004
Springer
15 years 2 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
61
Voted
CCE
2008
14 years 9 months ago
2008
This paper addresses the problem of the optimal design of batch plants with imprecise demands and proposes an alternative treatment of the imprecision by using fuzzy concepts. For...