1996 search results - page 59 / 400 » A decision procedure for linear |
ENTCS
2007
14 years 12 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
PR
2006
14 years 11 months ago
2006
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
IPL
2010
14 years 10 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
SIGPRO
2010
14 years 6 months ago
2010
In this paper, we address the problem of determining the order of MISO channels by means of a series of hypothesis tests based on scalar statistics. Using estimated 4th-order outp...
NDJFL
1998
14 years 11 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...