457 search results - page 24 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
144
click to vote
CATS
2007
15 years 7 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
169
click to vote
HYBRID
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We consider the dynamic feedback problem in a class of hybrid systems modeled as (infinite) state deterministic transition systems, in which the continuous variables are...
175
click to vote
WAOA
2007
Springer
16 years 4 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
163
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
162
click to vote
JAIR
2010
15 years 4 months ago
2010
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...