457 search results - page 33 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
144
Voted
COCO
2009
Springer
16 years 19 days ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
170
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
138
click to vote
UAI
2004
15 years 7 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
158
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
159
click to vote
DAC
1995
ACM
15 years 9 months ago
1995
ACM
The Elmore delay is an extremely popular delay metric, particularly for RC tree analysis. The widespread usage of this metric is mainly attributable to it being the most accurate ...