11716 search results - page 125 / 2344 » Computable symbolic dynamics |
171
click to vote
IFM
2010
Springer
2010
Springer
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
15 years 4 months ago
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
193
click to vote
FDL
2003
IEEE
15 years 11 months ago
2003
IEEE
Reconfigurable Systolic Arrays are a generalization of Systolic Arrays where node operations and interconnections can be redefined even at run time. This flexibility increases the...
181
click to vote
ASAP
2006
IEEE
15 years 10 months ago
2006
IEEE
Early FPGA researchers understood that FPGAs made possible the creation of a new, flexible, and powerful class of machine -- the configurable computing machine (CCM). The earliest...
161
click to vote
MCU
2004
15 years 7 months ago
2004
P systems with active membranes using only two electrical charges and only rules of type (a) , i.e., evolution rules used in parallel in the regions of the membrane system, and of ...
190
click to vote
IANDC
2007
15 years 6 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...