652 search results - page 6 / 131 » Linear Explicit Substitutions |
B
1998
Springer
13 years 11 months ago
1998
Springer
Let predicate P be converted from Boolean to numeric type by writing P , with false being 0 and true being 1, so that in a degenerate sense P can be regarded as `the probability th...
FOSSACS
2004
Springer
14 years 26 days ago
2004
Springer
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
BMCBI
2006
13 years 7 months ago
2006
Background: Non-coding DNA sequences comprise a very large proportion of the total genomic content of mammals, most other vertebrates, many invertebrates, and most plants. Unravel...
ACL
2006
13 years 9 months ago
2006
This paper investigates conceptually and empirically the novel sense matching task, which requires to recognize whether the senses of two synonymous words match in context. We sug...
AUTOMATICA
2002
13 years 7 months ago
2002
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimi...