2200 search results - page 259 / 440 » The Generalized Pignistic Transformation |
137
click to vote
ENTCS
2008
15 years 4 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
137
click to vote
ENTCS
2008
15 years 4 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
122
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
This paper investigates new ways of inferring nonlinear dependence from measured data. The existence of unique linear and nonlinear sub-spaces which are structural invariants of g...
132
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
134
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
: The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, ...