3670 search results - page 369 / 734 » Linear Recursive Functions |
189
click to vote
AAAI
2012
13 years 9 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
183
click to vote
COCO
2005
Springer
16 years 8 days ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
170
click to vote
CHARME
2003
Springer
15 years 12 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
206
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
209
click to vote
DT
2006
15 years 6 months ago
2006
The widely used engineering decisions concerning the performance of technological equipment for process industries are usually deterministic. Since the early 1990s probabilistic m...