3495 search results - page 84 / 699 » On the random satisfiable process |
101
click to vote
ICEIS
2006
IEEE
15 years 6 months ago
2006
IEEE
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
ENTCS
2008
15 years 25 days ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
126
click to vote
RSA
2011
14 years 7 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
93
Voted
CSDA
2007
15 years 22 days ago
2007
We develop regression diagnostics for functional regression models which relate a functional response to predictor variables that can be multivariate vectors or random functions. ...
94
Voted
DCC
2004
IEEE
16 years 10 days ago
2004
IEEE
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...